Sciweavers

4377 search results - page 625 / 876
» Mass problems and randomness
Sort
View
AUSAI
2007
Springer
15 years 10 months ago
Advances in Local Search for Satisfiability
In this paper we describe a stochastic local search (SLS) procedure for finding satisfying models of satisfiable propositional formulae. This new algorithm, gNovelty+ , draws on th...
Duc Nghia Pham, John Thornton, Charles Gretton, Ab...
CP
2007
Springer
15 years 10 months ago
Efficient Computation of Minimal Point Algebra Constraints by Metagraph Closure
Abstract. Computing the minimal network (or minimal CSP) representation of a given set of constraints over the Point Algebra (PA) is a fundamental reasoning problem. In this paper ...
Alfonso Gerevini, Alessandro Saetti
GECCO
2007
Springer
192views Optimization» more  GECCO 2007»
15 years 10 months ago
A new crossover technique for Cartesian genetic programming
Genetic Programming was first introduced by Koza using tree representation together with a crossover technique in which random sub-branches of the parents' trees are swapped ...
Janet Clegg, James Alfred Walker, Julian Francis M...
ALGOSENSORS
2006
Springer
15 years 10 months ago
Self-deployment Algorithms for Mobile Sensors on a Ring
Abstract. We consider the self-deployment problem in a ring for a network of identical sensors: starting from some initial random placement in the ring, the sensors in the network ...
Paola Flocchini, Giuseppe Prencipe, Nicola Santoro
BROADNETS
2004
IEEE
15 years 10 months ago
Routing in Ad Hoc Networks-A Wireless Perspective
Traditionally, the routing problem is addressed at the network layer, an approach that has been extended to the wireless realm. In wireless multihop networks, however, strict laye...
Martin Haenggi