Sciweavers

Share
CIVR
2006
Springer
139views Image Analysis» more  CIVR 2006»
8 years 8 months ago
Finding People Frequently Appearing in News
Abstract. We propose a graph based method to improve the performance of person queries in large news video collections. The method benefits from the multi-modal structure of videos...
Derya Ozkan, Pinar Duygulu
CP
2004
Springer
8 years 8 months ago
Concurrent Dynamic Backtracking for Distributed CSPs
A distributed concurrent search algorithm for distributed constraint satisfaction problems (DisCSPs) is presented. Concurrent search algorithms are composed of multiple search proc...
Roie Zivan, Amnon Meisels
ATAL
2006
Springer
8 years 8 months ago
No-commitment branch and bound search for distributed constraint optimization
We present a new polynomial-space algorithm for solving Distributed Constraint Optimization problems (DCOP). The algorithm, called NCBB, is branch and bound search with modificati...
Anton Chechetka, Katia P. Sycara
ICLP
2010
Springer
8 years 8 months ago
Learning Domain-Specific Heuristics for Answer Set Solvers
In spite of the recent improvements in the performance of Answer Set Programming (ASP) solvers, when the search space is sufficiently large, it is still possible for the search al...
Marcello Balduccini
LPAR
1994
Springer
8 years 8 months ago
A Generic Declarative Diagnoser for Normal Logic Programs
In this paper we develop a generic declarative diagnoser for normal logic programs that is based on tree search. The soundness and the completeness of the diagnoser are proved. The...
Lunjin Lu
ISSS
1996
IEEE
116views Hardware» more  ISSS 1996»
8 years 8 months ago
A Constructive Method for Exploiting Code Motion
In this paper we address a resource
Luiz C. V. dos Santos, Marc J. M. Heijligers, C. A...
PPSN
1998
Springer
8 years 8 months ago
Multi-parent Recombination in Genetic Algorithms with Search Space Boundary Extension by Mirroring
In previous work, we have investigated real coded genetic algorithms with several types of multi-parent recombination operators and found evidence that multi-parent recombination w...
Shigeyoshi Tsutsui
GECCO
1999
Springer
126views Optimization» more  GECCO 1999»
8 years 8 months ago
Improving Genetic Algorithms by Search Space Reductions (with Applications to Flow Shop Scheduling)
Crossover operators that preserve common components can also preserve representation level constraints. Consequently, these constraints can be used to beneficially reduce the sea...
Stephen Y. Chen, Stephen F. Smith
ICTAI
1999
IEEE
8 years 8 months ago
On the Fine Structure of Large Search Spaces
Recently there has been significant progress in our understanding of the computational nature of combinatorial problems. Randomized search methods, both complete and incomplete, o...
Carla P. Gomes, Bart Selman
ICDCS
1999
IEEE
8 years 8 months ago
Search Space Reduction in QoS Routing
To provide real-time service or engineer constrained-based paths, networks require the underlying routing algorithm to be able to find low-cost paths that satisfy given Quality-of...
Liang Guo, Ibrahim Matta
books