442 search results - page 63 / 89 » Discovering Heuristic Strategy for Solving Scheduling Proble... |
238
Voted
Book
"Constraint satisfaction is a general problem in which the goal is to find values for a set of variables that will satisfy a given set of constraints. It is the core of many a...
144
Voted
AIPS
2006
15 years 5 months ago
2006
Mixed-Initiative approaches to Planning and Scheduling are being applied in different real world domains. While several recent successful examples of such tools encourage a wider ...
122
Voted
IDA
2000
Springer
15 years 3 months ago
2000
Springer
The discovery of characteristic rules is a well-known data mining task and has lead to several successful applications. However, because of the descriptive nature of characteristic...
232
click to vote
AGP
2010
IEEE
15 years 8 months ago
2010
IEEE
Constraint Logic Programming (CLP) is one of the most successful branches of Logic Programming; it attracts the interest of theoreticians and practitioners, and it is currently use...
137
Voted
ASPLOS
2010
ACM
15 years 6 months ago
2010
ACM
Many parallel applications exhibit unpredictable communication between threads, leading to contention for shared objects. The choice of contention management strategy impacts stro...