Sciweavers

3250 search results - page 183 / 650
» An Algorithm to Solve a Linear Program
Sort
View
CONSTRAINTS
1999
105views more  CONSTRAINTS 1999»
15 years 6 months ago
Algorithmic Power from Declarative Use of Redundant Constraints
Interval constraints can be used to solve problems in numerical analysis. In this paper we show that one can improve the performance of such an interval constraint program by the ...
Maarten H. van Emden
HSNMC
2004
Springer
126views Multimedia» more  HSNMC 2004»
15 years 11 months ago
Hybrid Unicast and Multicast Flow Control: A Linear Optimization Approach
— In this paper, we present a solution to the general problem of flow control for both unicast and multicast IP networks. We formulate a convex optimization problem that can be ...
Homayoun Yousefi'zadeh, Fatemeh Fazel, Hamid Jafar...
CORR
2007
Springer
77views Education» more  CORR 2007»
15 years 6 months ago
On the interaction between sharing and linearity
nalysis of logic programs, abstract domains for detecting sharing and linearity ion are widely used. Devising abstract unification algorithms for such domains has proved to be ra...
Gianluca Amato, Francesca Scozzari
AAAI
2007
15 years 8 months ago
Anytime Coordination Using Separable Bilinear Programs
Developing scalable coordination algorithms for multi-agent systems is a hard computational challenge. One useful approach, demonstrated by the Coverage Set Algorithm (CSA), explo...
Marek Petrik, Shlomo Zilberstein
WLP
2007
Springer
16 years 14 days ago
spock: A Debugging Support Tool for Logic Programs under the Answer-Set Semantics
Answer-set programming (ASP) is an emerging logic-programming paradigm that strictly separates the description of a problem from its solving methods. Despite its semantic elegance,...
Martin Gebser, Jörg Pührer, Torsten Scha...