Sciweavers

1410 search results - page 169 / 282
» The Algorithmics of Solitaire-Like Games
Sort
View
ACG
2009
Springer
15 years 6 months ago
Automated Discovery of Search-Extension Features
One of the main challenges with selective search extensions is designing effective move categories (features). This is a manual trial and error task, which requires both intuition...
Pálmi Skowronski, Yngvi Björnsson, Mar...
67
Voted
APPROX
2009
Springer
115views Algorithms» more  APPROX 2009»
15 years 6 months ago
Small Clique Detection and Approximate Nash Equilibria
Recently, Hazan and Krauthgamer showed [12] that if, for a fixed small ε, an ε-best ε-approximate Nash equilibrium can be found in polynomial time in two-player games, then it ...
Lorenz Minder, Dan Vilenchik
WFLP
2009
Springer
297views Algorithms» more  WFLP 2009»
15 years 6 months ago
Programming with Multiple Paradigms in Lua
Abstract. Lua is a scripting language used in many industrial applications, with an emphasis on embedded systems and games. Two key points in the design of the language that led to...
Roberto Ierusalimschy
HIPC
2005
Springer
15 years 5 months ago
Cost-Optimal Job Allocation Schemes for Bandwidth-Constrained Distributed Computing Systems
Abstract. This paper formulates the job allocation problem in distributed systems with bandwidth-constrained nodes. The bandwidth limitations of the nodes play an important role in...
Preetam Ghosh, Kalyan Basu, Sajal K. Das
ATAL
2005
Springer
15 years 5 months ago
A decentralized bargaining protocol on dependent continuous multi-issue for approximate pareto optimal outcomes
Negotiation techniques have been demonstrated to be effective in solving complex multi-objective problems. When the optimization process operates on continuous variables, it can b...
Nicola Gatti, Francesco Amigoni