1381 search results - page 189 / 277 » Computational Complexity of Constraint Satisfaction |
153
click to vote
AGP
1996
IEEE
15 years 8 months ago
1996
IEEE
Compositional semantics allow to reason about programs in an incremental way, thus providing the formal base for the development of modular data-flow analyses. The major drawback ...
153
click to vote
CVRMED
1997
Springer
15 years 8 months ago
1997
Springer
E cient and powerful topologically adaptable deformable surfaces can be created by embedding and de ning discrete deformable surface models in terms of an A ne Cell Decomposition (...
153
click to vote
CCGRID
2007
IEEE
15 years 8 months ago
2007
IEEE
We describe a hybrid linear programming (LP) and evolutionary algorithm (EA) based resource matcher suitable for heterogeneous grid environments. The hybrid matcher adopts the ite...
135
click to vote
EDOC
2009
IEEE
15 years 7 months ago
2009
IEEE
Viewpoint modeling is an effective technique for specifying complex software systems in terms of a set of independent viewpoints and correspondences between them. Each viewpoint f...
156
Voted
KRDB
2003
15 years 5 months ago
2003
The Polylog framework is designed to provide a language for efficiently automating complex queries of information represented in multiple formats. A Polylog program contains a set...