13376 search results - page 432 / 2676 » Problem Solving with |
161
click to vote
CONSTRAINTS
2006
15 years 5 months ago
2006
We combine mixed integer linear programming (MILP) and constraint programming (CP) to minimize tardiness in planning and scheduling. Tasks are allocated to facilities using MILP an...
131
click to vote
WSC
2008
15 years 7 months ago
2008
We introduce a new approach, called Relative Start and Idle Time (RSIT), to solve probabilistic scheduling problems of construction repetitive projects. RSIT is a process of deter...
152
click to vote
ICPR
2010
IEEE
15 years 9 months ago
2010
IEEE
In this paper we provide a framework of detection and localization of multiple similar shapes or object instances from an image based on shape matching. There are three challenges...
112
click to vote
CP
2009
Springer
15 years 11 months ago
2009
Springer
This paper describes a new approach for solving disjunctive temporal problems such as the open shop and job shop scheduling domains. Much previous research in systematic search app...
124
click to vote
AAAI
2010
15 years 6 months ago
2010
Depth-first proof-number search (df-pn) is powerful AND/OR tree search to solve positions in games. However, df-pn has a notorious problem of infinite loops when applied to domain...