187,593 research outputs found
Martin Upton, Farm Management in Africa : the principles of production and planning
Stuckey Barbara. Martin Upton, Farm Management in Africa : the principles of production and planning. In: Tiers-Monde, tome 15, n°58, 1974. p. 441
Sequential Time Splitting and Bounds Communication for a Portfolio of Optimization Solvers
Scheduling a subset of solvers belonging to a given portfolio has proven to be a good strategy when solving Constraint Satisfaction Problems (CSPs). In this paper, we show that this approach can also be effective for Constraint Optimization Problems (COPs). Unlike CSPs, sequential execution of optimization solvers can communicate information in the form of bounds to improve the performance of the following solvers. We provide a hybrid and flexible portfolio approach that combines static and dynamic time splitting for solving a given COP. Empirical evaluations show the approach is promising and sometimes even able to outperform the best solver of the porfolio. © 2014 Springer International Publishing Switzerland
EVE Online’s war correspondents: player journalism as history
This chapter examines three news sites – EveNews24, TheMittani.com and Crossing Zebras – attendant upon the 12-year old Massively Multiplayer Online Game, EVE Online. It explores the role that EVE’s journalists and the historicising process of journalism play in constructing the game’s history, and considers the relationship between this journalism, fan practice and the game community. It concludes that EVE’s journalism does produce history, but that this is a history of and for an elite group of EVE players, arising from fandom of a particular approach to EVE play
Author-wise bibliometric analysis based on entropy.
Author-wise bibliometric analysis based on entropy.</p
Sweep-based propagation for string constraint solving
Solving constraints over strings is an emerging important field. Recently, a Constraint Programming approach based on dashed strings has been proposed to enable a compact domain representation for potentially large bounded-length string variables. In this paper, we present a more efficient algorithm for propagating equality (and related constraints) over dashed strings. We call this propagation sweep-based. Experimental evidences show that sweep-based propagation is able to significantly outperform state-of-the-art approaches for string constraint solving
Propagating Regular membership with dashed strings
Using dashed strings is an approach recently introduced in Constraint Programming (CP) to represent the domain of string variables, when solving combinatorial problems with string constraints. One of the most important string constraints is that of regular membership: regular (x, R) imposes string x to be a member of the regular language defined by automaton R. The regular constraint is useful for specifying complex constraints on fixed length finite sequences, and regularly appears in CP models. Dealing with regular is also desirable in software testing and verification, because regular expressions are often used in modern programming languages for pattern matching. In this paper, we define a regular propagator for dashed string solvers. We show that this propagator, implemented in the G-Strings solver, is substantially better than the current state-of-the-art. We also demonstrate that many regular constraints appearing in string solving benchmarks can actually be tackled by dashed strings solvers without explicitly using REGULAR
Going Beyond Counting First Authors in Author Co-citation Analysis
The present study examines one of the fundamental aspects of author co-citation analysis (ACA) - the way co-citation
counts are defined. Co-citation counting provides the data on which all subsequent statistical analyses and mappings
are based, and we compare ACA results based on two different types of co-citation counting - the traditional type that
only counts the first one among a cited work's authors on the one hand and a non-traditional type that takes into
account the first 5 authors of a cited work on the other hand. Results indicate that the picture produced through this non-traditional author co-citation counting contains more coherent author groups and is therefore considerably clearer. However, this picture represents fewer specialties in the research field being studied than that produced through the traditional first-author co-citation counting when the same number of top-ranked authors is selected and analyzed. Reasons for these effects are discussed
Results for the <i>Chu & Stuckey</i> (30×30 to 125×125) and <i>Carvalho & Soma</i> (150×150 to 200×200) datasets.
Results for the Chu & Stuckey (30×30 to 125×125) and Carvalho & Soma (150×150 to 200×200) datasets.</p
Propagating lex, find and replace with dashed strings
Dashed strings have been recently proposed in Constraint Programming to represent the domain of string variables when solving combinatorial problems over strings. This approach showed promising performance on some classes of string problems, involving constraints like string equality and concatenation. However, there are a number of string constraints for which no propagator has yet been defined. In this paper, we show how to propagate lexicographic ordering (lex), find and replace with dashed strings. All of these are fundamental string operations: lex is the natural total order over strings, while find and replace are frequently used in string manipulation. We show that these propagators, that we implemented in G-Strings solver, allows us to be competitive with state-of-the-art approaches
String constraint solving: Past, present and future
String constraint solving is an important emerging field, given the ubiquity of strings over different fields such as formal analysis, automated testing, database query processing, and cybersecurity. This paper highlights the current state-of-the-art for string constraint solving, and identifies future challenges in this field
- …
