6894 search results - page 280 / 1379 » Generation Problems |
215
click to vote
HYBRID
2010
Springer
15 years 8 months ago
2010
Springer
In this paper, we describe a receding horizon scheme that satisfies a class of linear temporal logic specifications sufficient to describe a wide range of properties including saf...
157
click to vote
EVOW
2005
Springer
16 years 3 days ago
2005
Springer
In this paper, we combine a powerful representation for graph colouring problems with different heuristic strategies for colour assignment. Our novel strategies employ heuristics ...
183
click to vote
ICASSP
2009
IEEE
16 years 1 months ago
2009
IEEE
The LCD deblurring problem is considered as a simple bounded quadratic programming problem and is solved using conjugate gradient with early stopping criteria to avoid excessive s...
198
click to vote
LION
2009
Springer
16 years 1 months ago
2009
Springer
Graph partitioning is a well-known optimization problem of great interest in theoretical and applied studies. Since the 1990s, many multilevel schemes have been introduced as a pra...
153
click to vote
GI
2007
Springer
15 years 10 months ago
2007
Springer
: The decomposition of planning and scheduling problems is a well known technique to make these problems tractable. The resulting dependable subproblems were often solved using dif...