Sciweavers

1631 search results - page 19 / 327
» Extreme Programming - Back to Basics
Sort
View
CP
2004
Springer
14 years 3 months ago
Heuristic Selection for Stochastic Search Optimization: Modeling Solution Quality by Extreme Value Theory
The success of stochastic algorithms is often due to their ability to effectively amplify the performance of search heuristics. This is certainly the case with stochastic sampling ...
Vincent A. Cicirello, Stephen F. Smith
CP
2010
Springer
13 years 8 months ago
A Box-Consistency Contractor Based on Extremal Functions
Abstract. Interval-based methods can approximate all the real solutions of a system of equations and inequalities. The Box interval constraint propagation algorithm enforces Box co...
Gilles Trombettoni, Yves Papegay, Gilles Chabert, ...
ALIFE
2004
13 years 9 months ago
Basic Autonomy as a Fundamental Step in the Synthesis of Life
In the search for the primary roots of autonomy (a pivotal concept in Varela's comprehensive understanding of living beings), the theory of autopoiesis provided an explicit cr...
Kepa Ruiz-Mirazo, Alvaro Moreno
IOR
2010
98views more  IOR 2010»
13 years 7 months ago
A Shadow Simplex Method for Infinite Linear Programs
We present a Simplex-type algorithm, that is, an algorithm that moves from one extreme point of the infinite-dimensional feasible region to another not necessarily adjacent extrem...
Archis Ghate, Dushyant Sharma, Robert L. Smith
STOC
2003
ACM
193views Algorithms» more  STOC 2003»
14 years 10 months ago
Space efficient dynamic stabbing with fast queries
In dynamic stabbing, we operate on a dynamic set of intervals. A stabbing query asks for an interval containing a given point. This basic problem encodes problems such as method l...
Mikkel Thorup