Sciweavers

6455 search results - page 67 / 1291
» Research problems
Sort
View
122
Voted
AAAI
2011
14 years 2 months ago
Exploiting Problem Symmetries in State-Based Planners
Previous research in Artificial Intelligence has identified the possibility of simplifying planning problems via the identification and exploitation of symmetries. We advance t...
Nir Pochter, Aviv Zohar, Jeffrey S. Rosenschein
CPAIOR
2009
Springer
15 years 9 months ago
Solution Enumeration for Projected Boolean Search Problems
Many real-world problems require the enumeration of all solutions of combinatorial search problems, even though this is often infeasible in practice. However, not always all parts ...
Martin Gebser, Benjamin Kaufmann, Torsten Schaub
119
Voted
ISI
2005
Springer
15 years 8 months ago
Discovering Identity Problems: A Case Study
Identity resolution is central to fighting against crime and terrorist activities in various ways. Current information systems and technologies deployed in law enforcement agencies...
Alan Gang Wang, Homa Atabakhsh, Tim Petersen, Hsin...
CORR
2010
Springer
163views Education» more  CORR 2010»
15 years 24 days ago
Faster Algorithms for Semi-Matching Problems
We consider the problem of finding semi-matching in bipartite graphs which is also extensively studied under various names in the scheduling literature. We give faster algorithms ...
Jittat Fakcharoenphol, Bundit Laekhanukit, Danupon...
SETN
2004
Springer
15 years 7 months ago
Inherent Choice in the Search Space of Constraint Satisfaction Problem Instances
Abstract. Constructive methods obtain solutions to constraint satisfaction problem instances by iteratively extending consistent partial assignments. In this research, we study the...
George Boukeas, Panagiotis Stamatopoulos, Constant...