2410 search results - page 86 / 482 » Multiset Ordering Constraints |
162
click to vote
ETFA
2006
IEEE
15 years 8 months ago
2006
IEEE
Classical off-line approaches based on preemption such as RM (Rate Monotonic), DM (Deadline Monotonic), EDF (Earliest Deadline First), LLF (Least Laxity First), etc, give schedula...
110
click to vote
VLDB
1991
ACM
15 years 8 months ago
1991
ACM
The Ode object-oriented database provides facilities for associating conslraims and [riggers with ohjecls. Conslrainls and triggers are associated with class (ohjea type) definiti...
168
click to vote
AIMSA
2008
Springer
15 years 7 months ago
2008
Springer
We present a hybrid approach to Distributed Constraint Satisfaction which combines incomplete, fast, penalty-based local search with complete, slower systematic search. Thus, we pr...
131
click to vote
CAD
2006
Springer
15 years 5 months ago
2006
Springer
In this paper, we propose a method which can be used to decompose a 2D or 3D constraint problem into a C-tree. With this decomposition, a geometric constraint problem can be reduc...
144
click to vote
IJON
2008
15 years 4 months ago
2008
This paper proposed a kind of unsupervised learning neural network model, which has special structure and can realize an evaluation and classification of many groups by the compres...