136 search results - page 16 / 28 » Using Rewarding Mechanisms for Improving Branching Heuristic... |
ECAI
2004
Springer
14 years 27 days ago
2004
Springer
Abstract. One key issue facing robotic teams is effective coordination mechanisms. Many robotic groups operate within domains where restrictions such as limiting areas of operation...
DSN
2009
IEEE
14 years 2 months ago
2009
IEEE
Dynamic symbolic execution is a structural testing technique that systematically explores feasible paths of the program under test by running the program with different test input...
ISCA
2002
IEEE
13 years 7 months ago
2002
IEEE
In this paper, we consider the tree task graphs which arise from many important programming paradigms such as divide and conquer, branch and bound etc., and the linear task-graphs...
AAMAS
2007
Springer
13 years 7 months ago
2007
Springer
A component-based generic agent architecture for multi-attribute (integrative) negotiation is introduced and its application is described in a prototype system for negotiation abo...
WEA
2010
Springer
14 years 2 months ago
2010
Springer
Abstract We report on experiments with turning the branch-price-andcut framework SCIP into a generic branch-price-and-cut solver. That is, given a mixed integer program (MIP), our ...