1226 search results - page 185 / 246 » Proofs, Programs and Abstract Complexity |
117
click to vote
HICSS
2003
IEEE
15 years 5 months ago
2003
IEEE
The assignment problem originally arising from parallel and distributed computing has been investigated intensively since the 70’s when Harold Stone proposed a method to solve i...
CP
2003
Springer
15 years 5 months ago
2003
Springer
Abstract. Most previous theoretical study of the complexity of the constraint satisfaction problem has considered a simplified version of the problem in which all variables have t...
ICDT
1997
ACM
15 years 4 months ago
1997
ACM
Abstract Method invocation mechanism is one of the essential features in objectoriented programming languages. This mechanism contributes to data encapsulation and code reuse, but ...
CP
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. The constraint satisfaction problem can be solved in polynomial time for instances where certain parameters (e.g., the treewidth of primal graphs) are bounded. However, t...
115
click to vote
CONSTRAINTS
2006
14 years 12 months ago
2006
Abstract. Constraint Programming (CP) offers a rich modeling language of constraints embedding efficient algorithms to handle complex and heterogeneous combinatorial problems. To s...