2109 search results - page 34 / 422 » Solving Necklace Constraint Problems |
135
click to vote
HICSS
1994
IEEE
15 years 8 months ago
1994
IEEE
We are developing a new problem-solving methodology based on a self-organization paradigm. To realize our future goal of self-organizing computational systems, we have to study co...
143
click to vote
ESOP
2009
Springer
15 years 8 months ago
2009
Springer
The context-free language (CFL) reachability problem is well known and studied in computer science, as a fundamental problem underlying many important static analyses such as point...
145
click to vote
IFIP
2004
Springer
15 years 9 months ago
2004
Springer
We study the general packing problem with M constraints. In [Jansen and Zhang, TCS 2002] a c(1 + ε)-approximation algorithm for the general packing problem was proposed. A block s...
136
click to vote
ESA
2010
Springer
15 years 4 months ago
2010
Springer
We report on the solution of a real-time scheduling problem that arises in the design of software-based operation control of aircraft. A set of tasks has to be distributed on a min...
141
click to vote
VMCAI
2009
Springer
15 years 11 months ago
2009
Springer
A new approach based on constraint solving techniques was recently proposed for verification of hybrid systems. This approach works by searching for inductive invariants of a give...