Sciweavers

97 search results - page 6 / 20
» Local Strategy Improvement for Parity Game Solving
Sort
View
CORR
2012
Springer
286views Education» more  CORR 2012»
12 years 4 months ago
A Faster Algorithm for Solving One-Clock Priced Timed Games
One-clock priced timed games is a class of two-player, zero-sum, continuous-time games that was defined and thoroughly studied in previous works. We show that One-clock priced ti...
Thomas Dueholm Hansen, Rasmus Ibsen-Jensen, Peter ...
AAAI
1994
13 years 10 months ago
GENET: A Connectionist Architecture for Solving Constraint Satisfaction Problems by Iterative Improvement
New approaches to solving constraint satisfaction problems using iterative improvement techniques have been found to be successful on certain, very large problems such as the mill...
Andrew J. Davenport, Edward P. K. Tsang, Chang J. ...
ICALP
2007
Springer
14 years 2 months ago
Reachability-Time Games on Timed Automata
d Abstract) Marcin Jurdzi´nski and Ashutosh Trivedi Department of Computer Science, University of Warwick, UK In a reachability-time game, players Min and Max choose moves so that...
Marcin Jurdzinski, Ashutosh Trivedi
ICCBR
2005
Springer
14 years 2 months ago
Language Games: Solving the Vocabulary Problem in Multi-Case-Base Reasoning
The problem of heterogeneous case representation poses a major obstacle to realising real-life multi-case-base reasoning (MCBR) systems. The knowledge overhead in developing and ma...
Paolo Avesani, Conor Hayes, Marco Cova
CEC
2008
IEEE
14 years 3 months ago
Solving large scale global optimization using improved Particle Swarm Optimizer
—As more and more real-world optimization problems become increasingly complex, algorithms with more capable optimizations are also increasing in demand. For solving large scale ...
Sheng-Ta Hsieh, Tsung-Ying Sun, Chan-Cheng Liu, Sh...