729 search results - page 40 / 146 » Solving subgraph isomorphism problems with constraint progra... |
137
click to vote
JMLR
2012
13 years 6 months ago
2012
We develop scalable algorithms for regular and non-negative matrix completion. In particular, we base the methods on trace-norm regularization that induces a low rank predicted ma...
139
click to vote
IROS
2008
IEEE
15 years 10 months ago
2008
IEEE
— We present a probabilistic architecture for solving generically the problem of extracting the task constraints through a Programming by Demonstration (PbD) framework and for ge...
155
Voted
CP
2008
Springer
15 years 5 months ago
2008
Springer
Modern computer architectures have complex features that can only be fully taken advantage of if the compiler schedules the compiled code. A standard region of code for scheduling ...
118
Voted
CPAIOR
2005
Springer
15 years 9 months ago
2005
Springer
Producing work schedules for airline crew normally results in individually different schedules. Some airlines do however want to give the same schedule to groups of people. The con...
150
Voted
CP
1999
Springer
15 years 8 months ago
1999
Springer
Abstract. In this paper, we present a major improvement in the search procedures in constraint programming. First, we integrate various search procedures from AI and OR. Second, we...