592 search results - page 88 / 119 » Using Constraint Programming to Solve the Maximum Clique Pro... |
133
Voted
INFOCOM
2010
IEEE
15 years 1 months ago
2010
IEEE
—This is by far the first paper considering joint optimization of link scheduling, routing and replication for disruption-tolerant networks (DTNs). The optimization problems for...
130
click to vote
ICLP
2001
Springer
15 years 7 months ago
2001
Springer
Abstract. Groundness analysis of logic programs using Pos-based abstract interpretation is one of the clear success stories of the last decade in the area of logic program analysis...
117
click to vote
ICTAI
1999
IEEE
15 years 7 months ago
1999
IEEE
Recently, there has been much interest in enhancing purely combinatorial formalisms with numerical information. For example, planning formalisms can be enriched by taking resource...
119
click to vote
SIAMJO
2000
15 years 2 months ago
2000
Abstract. Despite the efficiency shown by interior-point methods in large-scale linear programming, they usually perform poorly when applied to multicommodity flow problems. The ne...
113
click to vote
LPNMR
2007
Springer
15 years 9 months ago
2007
Springer
We describe a new grounder system for logic programs under answer set semantics, called GrinGo. Our approach combines and extends techniques from the two primary grounding approach...