Sciweavers

3946 search results - page 493 / 790
» The computational complexity of choice sets
Sort
View
ECAI
2006
Springer
15 years 10 months ago
Boolean Games Revisited
Abstract. Game theory is a widely used formal model for studying strategical interactions between agents. Boolean games [8] are two players, zero-sum static games where players...
Elise Bonzon, Marie-Christine Lagasquie-Schiex, J&...
ECML
2006
Springer
15 years 10 months ago
Ensembles of Nearest Neighbor Forecasts
Nearest neighbor forecasting models are attractive with their simplicity and the ability to predict complex nonlinear behavior. They rely on the assumption that observations simila...
Dragomir Yankov, Dennis DeCoste, Eamonn J. Keogh
GECCO
2006
Springer
135views Optimization» more  GECCO 2006»
15 years 10 months ago
The no free lunch and realistic search algorithms
The No-Free-Lunch theorems (NFLTs) are criticized for being too general to be of any relevance to the real world scenario. This paper investigates, both formally and empirically, ...
Yossi Borenstein, Riccardo Poli
FOSSACS
2000
Springer
15 years 10 months ago
A Program Refinement Framework Supporting Reasoning about Knowledge and Time
Abstract. This paper develops a highly expressive semantic framework for program refinement that supports both temporal reasoning and reasoning about the knowledge of a single agen...
Kai Engelhardt, Ron van der Meyden, Yoram Moses
169
Voted
RIDE
1998
IEEE
15 years 10 months ago
Design of Multi-user Editing Servers for Continuous Media
Based on a fifteen month investigation of a post production facilities for both the entertainment industry and broadcasters, we identified a number of challenges with the design an...
Seon Ho Kim, Shahram Ghandeharizadeh