Sciweavers

SODA
2004
ACM
115views Algorithms» more  SODA 2004»
13 years 6 months ago
Minimizing the stabbing number of matchings, trees, and triangulations
The (axis-parallel) stabbing number of a given set of line segments is the maximum number of segments that can be intersected by any one (axis-parallel) line. We investigate probl...
Sándor P. Fekete, Marco E. Lübbecke, H...
HIS
2007
13 years 6 months ago
Active Selection of Training Examples for Meta-Learning
Meta-Learning has been used to relate the performance of algorithms and the features of the problems being tackled. The knowledge in Meta-Learning is acquired from a set of meta-e...
Ricardo Bastos Cavalcante Prudêncio, Teresa ...
ECAI
2006
Springer
13 years 7 months ago
Solving Optimization Problems with DLL
Propositional satisfiability (SAT) is a success story in Computer Science and Artificial Intelligence: SAT solvers are currently used to solve problems in many different applicati...
Enrico Giunchiglia, Marco Maratea
AIMSA
2008
Springer
13 years 7 months ago
DynABT: Dynamic Asynchronous Backtracking for Dynamic DisCSPs
Abstract. Constraint Satisfaction has been widely used to model static combinatorial problems. However, many AI problems are dynamic and take place in a distributed environment, i....
Bayo Omomowo, Inés Arana, Hatem Ahriz
FLAIRS
2008
13 years 7 months ago
Tractable Class of a Problem of Goal Satisfaction in Mutual Exclusion Network
In this paper we describe a class of a problem of goal satisfaction in mutual exclusion network that can be solved in polynomial time. This problem provides a common basis for rea...
Pavel Surynek
CIAC
2010
Springer
232views Algorithms» more  CIAC 2010»
13 years 8 months ago
Multicut Algorithms via Tree Decompositions
Various forms of multicut problems are of great importance in the area of network design. In general, these problems are intractable. However, several parameters have been identifi...
Reinhard Pichler, Stefan Rümmele, Stefan Woltran
ECML
2006
Springer
13 years 8 months ago
Improving Control-Knowledge Acquisition for Planning by Active Learning
Automatically acquiring control-knowledge for planning, as it is the case for Machine Learning in general, strongly depends on the training examples. In the case of planning, examp...
Raquel Fuentetaja, Daniel Borrajo
CSR
2006
Springer
13 years 8 months ago
SZK Proofs for Black-Box Group Problems
In this paper we classify several algorithmic problems in group theory in the classes PZK and SZK (problems with perfect/statistical zero-knowledge proofs respectively). Prior to ...
Vikraman Arvind, Bireswar Das
CIS
2006
Springer
13 years 8 months ago
A New Multi-objective Evolutionary Optimisation Algorithm: The Two-Archive Algorithm
Many Multi-Objective Evolutionary Algorithms (MOEAs) have been proposed in recent years. However, almost all MOEAs have been evaluated on problems with two to four objectives only...
Kata Praditwong, Xin Yao
DSN
2004
IEEE
13 years 8 months ago
Why PCs Are Fragile and What We Can Do About It: A Study of Windows Registry Problems
Software configuration problems are a major source of failures in computer systems. In this paper, we present a new framework for categorizing configuration problems. We apply thi...
Archana Ganapathi, Yi-Min Wang, Ni Lao, Ji-Rong We...