Sciweavers

1984 search results - page 135 / 397
» The colourful feasibility problem
Sort
View
DAGSTUHL
2004
13 years 11 months ago
Simplicity Considered Fundamental to Design for Predictability
Complexity is the core problem of contemporary information technology, as the "artificial complicatedness" of its artefacts is exploding. Intellectually easy and economic...
Wolfgang A. Halang
CCE
2008
13 years 10 months ago
Global optimization of multiscenario mixed integer nonlinear programming models arising in the synthesis of integrated water net
The problem of optimal synthesis of an integrated water system is addressed in this work, where water using processes and water treatment operations are combined into a single net...
Ramkumar Karuppiah, Ignacio E. Grossmann
TROB
2002
127views more  TROB 2002»
13 years 9 months ago
Probabilistic pursuit-evasion games: theory, implementation, and experimental evaluation
We consider the problem of having a team of Unmanned Aerial Vehicles (UAV) and Unmanned Ground Vehicles (UGV) pursue a second team of evaders while concurrently building a map in a...
René Vidal, Omid Shakernia, H. Jin Kim, Dav...
NFM
2011
242views Formal Methods» more  NFM 2011»
13 years 5 months ago
Model Checking Using SMT and Theory of Lists
A main idea underlying bounded model checking is to limit the length of the potential counter-examples, and then prove properties for the bounded version of the problem. In softwar...
Aleksandar Milicevic, Hillel Kugler
ICSM
2007
IEEE
14 years 4 months ago
SCARPE: A Technique and Tool for Selective Capture and Replay of Program Executions
Because of software’s increasing dynamism and the heterogeneity of execution environments, the results of in-house testing and maintenance are often not representative of the wa...
Shrinivas Joshi, Alessandro Orso