Sciweavers

1380 search results - page 162 / 276
» Computing the optimal strategy to commit to
Sort
View
AUTOMATICA
2005
108views more  AUTOMATICA 2005»
13 years 8 months ago
Enlarging the domain of attraction of MPC controllers
This paper presents a method for enlarging the domain of attraction of nonlinear model predictive control (MPC). The usual way of guaranteeing stability of nonlinear MPC is to add...
Daniel Limón, T. Alamo, Eduardo F. Camacho
PE
2007
Springer
137views Optimization» more  PE 2007»
13 years 7 months ago
A prediction method for job runtimes on shared processors: Survey, statistical analysis and new avenues
Grid computing is an emerging technology by which huge numbers of processors over the world create a global source of processing power. Their collaboration makes it possible to pe...
Menno Dobber, Robert D. van der Mei, Ger Koole
ATAL
2007
Springer
14 years 2 months ago
Approximate and online multi-issue negotiation
This paper analyzes bilateral multi-issue negotiation between selfinterested autonomous agents. The agents have time constraints in the form of both deadlines and discount factors...
S. Shaheen Fatima, Michael Wooldridge, Nicholas R....
EDBT
2008
ACM
169views Database» more  EDBT 2008»
14 years 8 months ago
BioScout: a life-science query monitoring system
Scientific data are available through an increasing number of heterogeneous, independently evolving, sources. Although the sources themselves are independently evolving, the data ...
Anastasios Kementsietsidis, Frank Neven, Dieter Va...
GECCO
2006
Springer
157views Optimization» more  GECCO 2006»
13 years 11 months ago
How randomized search heuristics find maximum cliques in planar graphs
Surprisingly, general search heuristics often solve combinatorial problems quite sufficiently, although they do not outperform specialized algorithms. Here, the behavior of simple...
Tobias Storch