Sciweavers

1921 search results - page 149 / 385
» Making AC-3 an Optimal Algorithm
Sort
View
117
Voted
IFL
1997
Springer
136views Formal Methods» more  IFL 1997»
15 years 6 months ago
Fully Persistent Graphs - Which One To Choose?
Functional programs, by nature, operate on functional, or persistent, data structures. Therefore, persistent graphs are a prerequisite to express functional graph algorithms. In th...
Martin Erwig
CATA
2003
15 years 3 months ago
Efficient Even Distribution of Power Consumption in Wireless Sensor Networks
One of the limitations of wireless sensor nodes is their inherent limited energy resource. Besides maximizing the lifetime of the sensor node, it is preferable to distribute the e...
Ioan Raicu
GECCO
2007
Springer
184views Optimization» more  GECCO 2007»
15 years 8 months ago
Experimental analysis of binary differential evolution in dynamic environments
Many real-world optimization problems are dynamic in nature. The interest in the Evolutionary Algorithms (EAs) community in applying EA variants to dynamic optimization problems h...
Alp Emre Kanlikilicer, Ali Keles, Sima Uyar
100
Voted
COCO
2004
Springer
95views Algorithms» more  COCO 2004»
15 years 7 months ago
Consequences and Limits of Nonlocal Strategies
This paper investigates the powers and limitations of quantum entanglement in the context of cooperative games of incomplete information. We give several examples of such nonlocal...
Richard Cleve, Peter Høyer, Benjamin Toner,...
IAT
2010
IEEE
15 years 9 days ago
Getting What You Pay For: Is Exploration in Distributed Hill Climbing Really Worth it?
Abstract--The Distributed Stochastic Algorithm (DSA), Distributed Breakout Algorithm (DBA), and variations such as Distributed Simulated Annealing (DSAN), MGM-1, and DisPeL, are di...
Melanie Smith, Roger Mailler