Sciweavers

16091 search results - page 278 / 3219
» Solving
Sort
View
LICS
2009
IEEE
16 years 1 months ago
An Exponential Lower Bound for the Parity Game Strategy Improvement Algorithm as We Know it
This paper presents a new lower bound for the discrete strategy improvement algorithm for solving parity games due to V¨oge and Jurdzi´nski. First, we informally show which stru...
Oliver Friedmann
AMT
2009
Springer
116views Multimedia» more  AMT 2009»
16 years 1 months ago
Unifying Web-Scale Search and Reasoning from the Viewpoint of Granularity
Considering the time constraints and Web scale data, it is impossible to achieve absolutely complete reasoning results. Plus, the same results may not meet the diversity of user ne...
Yi Zeng, Yan Wang, Zhisheng Huang, Ning Zhong
EPIA
2009
Springer
16 years 1 months ago
Colored Nonograms: An Integer Linear Programming Approach
Abstract. In this paper we study colored nonogram solving using Integer Linear Programming. Our approach generalizes the one used by Robert A. Bosch which was developed for black a...
Luís Mingote, Francisco Azevedo
CANDC
2009
ACM
16 years 1 months ago
A quantitative analysis of the collective creativity in playing 20-questions games
Creativity is an important ingredient in problem solving, and problem solving is an important activity for both individuals and societies. This paper discusses our novel approach ...
Wen Dong, Taemie Kim, Alex Pentland
CIMCA
2008
IEEE
16 years 1 months ago
LGR: The New Genetic Based Scheduler for Grid Computing Systems
—The computational grid provides a promising platform for the deployment of various high-performance computing applications. In computational grid, an efficient scheduling of tas...
Leili Mohammad Khanli, Seyad Naser Razavi, Nima Ja...