Sciweavers

1144 search results - page 82 / 229
» Logic programming for combinatorial problems
Sort
View
JMLR
2010
149views more  JMLR 2010»
14 years 9 months ago
Learning Bayesian Network Structure using LP Relaxations
We propose to solve the combinatorial problem of finding the highest scoring Bayesian network structure from data. This structure learning problem can be viewed as an inference pr...
Tommi Jaakkola, David Sontag, Amir Globerson, Mari...
SODA
2010
ACM
397views Algorithms» more  SODA 2010»
15 years 12 months ago
Improved Approximation Algorithms for the Minimum Latency Problem via Prize-Collecting Strolls
The minimum latency problem (MLP) is a well-studied variant of the traveling salesman problem (TSP). In the MLP, the server's goal is to minimize the average latency that the...
Aaron Archer, Anna Blasiak
137
Voted
COR
2007
106views more  COR 2007»
15 years 2 months ago
On a stochastic sequencing and scheduling problem
We present a framework for solving multistage pure 0–1 programs for a widely used sequencing and scheduling problem with uncertainty in the objective function coefficients, the...
Antonio Alonso-Ayuso, Laureano F. Escudero, M. Ter...
ATAL
2006
Springer
15 years 6 months ago
TANDEM - a design method for integrating web services into multi-agent systems
This paper introduces a new design method for multi-agent systems (MAS) that incorporate logic programming. The DigitalFriend is an example of a MAS with a built-in logic language...
Steve Goschnick, Sandrine Balbo, Leon Sterling, Ch...
EVOW
1994
Springer
15 years 6 months ago
Genetic Approaches to Learning Recursive Relations
The genetic programming (GP) paradigm is a new approach to inductively forming programs that describe a particular problem. The use of natural selection based on a fitness ]unction...
Peter A. Whigham, Robert I. McKay