1016 search results - page 10 / 204 » Parallelism Constraints |
95
Voted
ICLP
1995
Springer
15 years 3 months ago
1995
Springer
Incorporating the possibility of attaching attributes to variables in a logic programming system has been shown to allow the addition of general constraint solving capabilities to...
114
click to vote
IEEEPACT
1997
IEEE
15 years 3 months ago
1997
IEEE
† In this paper, we propose a parallel randomized algorithm, called Parallel Fast Assignment using Search Technique (PFAST), for scheduling parallel programs represented by direc...
99
Voted
PPSN
1998
Springer
15 years 3 months ago
1998
Springer
This paper presents a comparative study of Evolutionary Algorithms (EAs) for Constraint Satisfaction Problems (CSPs). We focus on EAs where fitness is based on penalization of cons...
106
click to vote
IAJIT
2011
14 years 6 months ago
2011
: This paper proposes a constraint programming based approach to handle ontologies consistency, and more precisely user-defined consistencies. In practice, ontologies consistency i...
101
Voted
JSSPP
2000
Springer
15 years 3 months ago
2000
Springer
Abstract. Buffered coscheduling is a new methodology that can substantially increase resource utilization, improve response time, and simplify the development of the run-time suppo...