2398 search results - page 278 / 480 » Constraint Programming and Graph Algorithms |
200
click to vote
ILP
2004
Springer
15 years 11 months ago
2004
Springer
For the last ten years a lot of work has been devoted to propositionalization techniques in relational learning. These techniques change the representation of relational problems t...
212
click to vote
FUN
2010
Springer
15 years 9 months ago
2010
Springer
In job scheduling with precedence constraints, i j means that job j cannot start being processed before job i is completed. In this paper we consider selfish bully jobs who do no...
160
click to vote
ESOP
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. In a functional language, the dominant control-flow mechanism is function call and return. Most higher-order flow analyses, including k-CFA, do not handle call and retu...
158
click to vote
COMSIS
2010
15 years 3 months ago
2010
The concept of complexity is used in many areas of computer science and software engineering. Software complexity metrics can be used to evaluate and compare quality of software de...
146
click to vote
GD
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. A graph is planar if and only if it does not contain a Kuratowski subdivision. Hence such a subdivision can be used as a witness for non-planarity. Modern planarity testi...