Sciweavers

501 search results - page 60 / 101
» Scheduling Abstractions for Local Search
Sort
View
CORR
2002
Springer
81views Education» more  CORR 2002»
13 years 8 months ago
Value withdrawal explanations: a theoretical tool for programming environments
Abstract. Constraint logic programming combines declarativity and efficiency thanks to constraint solvers implemented for specific domains. Value withdrawal explanations have been ...
Willy Lesaint
BIBE
2007
IEEE
134views Bioinformatics» more  BIBE 2007»
14 years 2 months ago
Bottom-Up Multiple Row Addition Algorithms for the Biclustering-Problem
Abstract—The discovery of locally and significantly correlated subpatterns within a two-dimensional dataset has recently become quite popular and is amongst others addressed by ...
Hyung-Won Koh, Lars Hildebrand
ECAI
2004
Springer
14 years 1 months ago
Planning with Numerical Expressions in LPG
Abstract. We present some techniques for handling planning problems with numerical expressions that can be specified using the standard planning language PDDL. These techniques ar...
Alfonso Gerevini, Alessandro Saetti, Ivan Serina
CP
2006
Springer
14 years 7 days ago
Differentiable Invariants
Abstract. Invariants that incrementally maintain the value of expresder assignments to their variables are a natural abstraction to build high-level local search algorithms. But th...
Pascal Van Hentenryck, Laurent Michel
EVOW
2009
Springer
13 years 6 months ago
Conquering the Needle-in-a-Haystack: How Correlated Input Variables Beneficially Alter the Fitness Landscape for Neural Networks
Abstract. Evolutionary algorithms such as genetic programming and grammatical evolution have been used for simultaneously optimizing network architecture, variable selection, and w...
Stephen D. Turner, Marylyn D. Ritchie, William S. ...