Sciweavers

1144 search results - page 142 / 229
» Logic programming for combinatorial problems
Sort
View
LPNMR
2009
Springer
15 years 7 months ago
Manifold Answer-Set Programs for Meta-reasoning
Abstract. In answer-set programming (ASP), the main focus usually is on computing answer sets which correspond to solutions to the problem represented by a logic program. Simple re...
Wolfgang Faber, Stefan Woltran
CAEPIA
2003
Springer
15 years 6 months ago
Embracing Causality in Inducing the Effects of Actions
Abstract. The following problem will be considered: from scattered examples on the behavior of a dynamic system induce a description of the system. For the induced description to b...
Ramón P. Otero
WABI
2004
Springer
116views Bioinformatics» more  WABI 2004»
15 years 7 months ago
Topological Rearrangements and Local Search Method for Tandem Duplication Trees
—The problem of reconstructing the duplication history of a set of tandemly repeated sequences was first introduced by Fitch [4]. Many recent studies deal with this problem, show...
Denis Bertrand, Olivier Gascuel
UAI
2004
15 years 3 months ago
Bidding under Uncertainty: Theory and Experiments
This paper describes a study of agent bidding strategies, assuming combinatorial valuations for complementary and substitutable goods, in three auction environments: sequential au...
Amy R. Greenwald, Justin A. Boyan
EAAI
2008
101views more  EAAI 2008»
15 years 2 months ago
A global constraint for total weighted completion time for cumulative resources
The criterion of total weighted completion time occurs as a sub-problem of combinatorial optimization problems in such diverse areas as scheduling, container loading and storage a...
András Kovács, J. Christopher Beck