13376 search results - page 547 / 2676 » Problem Solving with |
207
click to vote
IJCAI
1997
15 years 8 months ago
1997
This paper presents a technique, called GENH, that automatically generates search heuristics for scheduling problems. The impetus for developing this technique is the growing cons...
213
click to vote
CPAIOR
2006
Springer
15 years 11 months ago
2006
Springer
Abstract. In this paper we introduce a complex allocation and scheduling problem for variable voltage Multi-Processor System-on-Chip (MPSoC) platforms. We propose a methodology to ...
176
Voted
CDC
2010
IEEE
15 years 2 months ago
2010
IEEE
Abstract-- We present a new algorithm for solving a polynomial program P based on the recent "joint + marginal" approach of the first author for parametric polynomial opt...
233
click to vote
LPNMR
2004
Springer
16 years 24 days ago
2004
Springer
Abstract. Many NP-complete problems can be encoded in the answer set semantics of logic programs in a very concise way, where the encoding reflects the typical “guess and check...
236
click to vote
AGP
2003
IEEE
16 years 23 days ago
2003
IEEE
Many NP-complete problems can be encoded in the answer set semantics of logic programs in a very concise way, where the encoding reflects the typical “guess and check” nature ...