Sciweavers

6279 search results - page 365 / 1256
» Studies in Solution Sampling
Sort
View
EMMCVPR
1997
Springer
15 years 11 months ago
Genetic Algorithms for Ambiguous Labelling Problems
Consistent labelling problems frequently have more than one solution. Most work in the "eld has aimed at disambiguating early in the interpretation process, using only local ...
Richard Myers, Edwin R. Hancock
LISA
2007
15 years 9 months ago
PoDIM: A Language for High-Level Configuration Management
The high rate of requirement changes make system administration a complex task. This complexity is further influenced by the increasing scale, unpredictable behaviour of software ...
Thomas Delaet, Wouter Joosen
IJCAI
2007
15 years 8 months ago
A Game-Theoretic Analysis of Strictly Competitive Multiagent Scenarios
This paper is a comparative study of game-theoretic solution concepts in strictly competitive multiagent scenarios, as commonly encountered in the context of parlor games, competi...
Felix Brandt, Felix A. Fischer, Paul Harrenstein, ...
AIPS
2006
15 years 8 months ago
Looking for Shortcuts: Infeasible Search Analysis for Oversubscribed Scheduling Problems
Searches that include both feasible and infeasible solutions have proved to be efficient algorithms for solving some scheduling problems. Researchers conjecture that these algorit...
Mark F. Rogers, Adele E. Howe, Darrell Whitley
SODA
2004
ACM
94views Algorithms» more  SODA 2004»
15 years 8 months ago
Quantitative stochastic parity games
We study perfect-information stochastic parity games. These are two-player nonterminating games which are played on a graph with turn-based probabilistic transitions. A play resul...
Krishnendu Chatterjee, Marcin Jurdzinski, Thomas A...