136 search results - page 4 / 28 » Using Rewarding Mechanisms for Improving Branching Heuristic... |
COR
2008
13 years 7 months ago
2008
Finding a feasible solution to a generic Mixed-Integer Program (MIP) is often a very difficult task. Recently, two heuristic approaches called Feasibility Pump and Local Branching...
MICRO
1998
IEEE
13 years 11 months ago
1998
IEEE
Path profiles record the frequencies of execution paths through a program. Until now, the best global instruction schedulers have relied upon profile-gathered frequencies of condi...
AI
2008
Springer
13 years 7 months ago
2008
Springer
Many collaborative multi-robot application domains have limited areas of operation that cause spatial conflicts between robotic teammates. These spatial conflicts can cause the te...
WCE
2007
13 years 8 months ago
2007
—Building a time series forecasting model by independent component analysis mechanism presents in the paper. Different from using the time series directly with the traditional A...
CADE
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. This article introduces two techniques to improve the propagation efficiency of CSP based finite model generation methods. One approach consists in statically rewriting ...