11328 search results - page 337 / 2266 » Timed Branching Processes |
145
click to vote
CP
2007
Springer
15 years 8 months ago
2007
Springer
Recent research has focused on using the power of look-ahead to speed up the resolution of the Max-SAT problem. Indeed, look-ahead techniques such as Unit Propagation (UP) allow to...
113
click to vote
ECAI
2004
Springer
15 years 8 months ago
2004
Springer
One important aspect in directing cognitive robots or agents is to formally specify what is expected of them. This is often referred to as goal specification. For agents whose act...
151
click to vote
CPAIOR
2006
Springer
15 years 8 months ago
2006
Springer
We define the timetable constrained distance minimization problem (TCDMP) which is a sports scheduling problem applicable for tournaments where the total travel distance must be mi...
134
click to vote
ECAI
2006
Springer
15 years 8 months ago
2006
Springer
A new search algorithm for solving distributed constraint optimization problems (DisCOPs) is presented. Agents assign variables sequentially and propagate their assignments asynchr...
164
Voted
ESTIMEDIA
2006
Springer
15 years 8 months ago
2006
Springer
This paper presents the influence of the loop nest splitting source code optimization on the worst-case execution time (WCET). Loop nest splitting minimizes the number of executed...