601 search results - page 65 / 121 » CSP(M): Constraint Satisfaction Problem over Models |
118
click to vote
EDBT
2004
ACM
16 years 1 months ago
2004
ACM
The join operation, which combines tuples from multiple relations, is the most fundamental and, typically, the most expensive operation in database queries. The standard approach t...
103
click to vote
CPAIOR
2010
Springer
15 years 6 months ago
2010
Springer
Interval coefficients have been introduced in OR and CP to specify uncertain data in order to provide reliable solutions to convex models. The output is generally a solution set, ...
JETAI
2007
15 years 1 months ago
2007
The Internet has led to the development of on-line markets, and computer scientists have designed various auction algorithms, as well as automated exchanges for standardized commo...
110
click to vote
CP
2003
Springer
15 years 6 months ago
2003
Springer
This work introduces a combinatorial optimization problem called Mars Express Memory Dumping Problem (Mex-Mdp), which arises in the European Space Agency program Mars Express. It c...
144
click to vote
ISLPED
2006
ACM
15 years 7 months ago
2006
ACM
As semiconductor manufacturing technology scales to smaller device sizes, the power consumption of clocked digital ICs begins to increase. Dynamic voltage and frequency scaling (D...