Sciweavers

11740 search results - page 325 / 2348
» More Problems in Rewriting
Sort
View
CP
2005
Springer
16 years 6 days ago
Robust Constraint Solving Using Multiple Heuristics
Abstract. Constraint Programming is a proven successful technique, but it requires skill in modeling problems, and knowledge on how algorithms interact with models. What can be a g...
Alfio Vidotto, Kenneth N. Brown, J. Christopher Be...
186
Voted
ANTS
2004
Springer
233views Algorithms» more  ANTS 2004»
16 years 2 days ago
Computing Order Statistics in the Farey Sequence
We study the problem of computing the k-th term of the Farey sequence of order n, for given n and k. Several methods for generating the entire Farey sequence are known. However, th...
Corina E. Patrascu, Mihai Patrascu
ER
2004
Springer
83views Database» more  ER 2004»
16 years 2 days ago
Automatic Location and Separation of Records: A Case Study in the Genealogical Domain
Abstract. Locating specific chunks (records) of information within documents on the web is an interesting and nontrivial problem. If the problem of locating and separating records...
Troy Walker, David W. Embley
GECCO
2004
Springer
140views Optimization» more  GECCO 2004»
16 years 2 days ago
A Sensitivity Analysis of a Cooperative Coevolutionary Algorithm Biased for Optimization
Abstract. Recent theoretical work helped explain certain optimizationrelated pathologies in cooperative coevolutionary algorithms (CCEAs). Such explanations have led to adopting sp...
Liviu Panait, R. Paul Wiegand, Sean Luke
ICA
2004
Springer
16 years 2 days ago
Blind Source Separation of Linear Mixtures with Singular Matrices
We consider the Blind Source Separation problem of linear mixtures with singular matrices and show that it can be solved if the sources are sufficiently sparse. More generally, we ...
Pando G. Georgiev, Fabian J. Theis