1221 search results - page 89 / 245 » A Comparison of Two Programming Models for Pervasive Computi... |
121
click to vote
ASP
2001
Springer
15 years 7 months ago
2001
Springer
We define a reduction system Ë¿ which preserves the stable semantics. This system includes two types of transformation rules. One type (which we call ˾) preserves the stable...
136
click to vote
CSCLP
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. We adopt Benders’ decomposition algorithm to solve scenariobased Stochastic Constraint Programs (SCPs) with linear recourse. Rather than attempting to solve SCPs via a ...
109
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Grothendieck inequalities are fundamental inequalities which are frequently used in many areas of mathematics and computer science. They can be interpreted as upper bounds for the ...
140
click to vote
CDC
2010
IEEE
14 years 10 months ago
2010
IEEE
This work focuses on optimal routing for two camera-equipped UAVs cooperatively tracking a single target moving on the ground. The UAVs are small fixed-wing aircraft cruising at a ...
140
click to vote
LPNMR
2007
Springer
2007
Springer
Alternative Characterizations for Program Equivalence under Answer-Set Semantics: Preliminary Report
15 years 9 months ago
Logic programs under answer-set semantics constitute an important tool for declarative problem solving. In recent years, two research issues received growing attention. On the one ...