2272 search results - page 70 / 455 » Capture Complexity by Partition |
187
click to vote
CONSTRAINTS
2008
15 years 6 months ago
2008
Abstract. Essence is a formal language for specifying combinatorial problems, in a manner similar to natural rigorous specifications that use a mixture of natural language and disc...
176
click to vote
IPPS
1997
IEEE
15 years 10 months ago
1997
IEEE
We propose a distributed data structure for maintaining spatial data sets on message-passing, distributed memory machines. The data structure is based on orthogonal bisection tree...
164
click to vote
CODES
1994
IEEE
15 years 10 months ago
1994
IEEE
We present an experimental framework for mapping declarative programs, written in a language known as Ruby, into various combinations of hardware and software. Strategies for para...
200
click to vote
GBRPR
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. Combinatorial maps define a general framework which allows to encode any subdivision of an nD orientable quasi-manifold with or without boundaries. Combinatorial pyramids...
186
click to vote
ICAS
2006
IEEE
16 years 20 days ago
2006
IEEE
By harnessing computational power of distributed heterogeneous resources, it is possible to build a large scale integrated system so that a centralized program is partitioned and ...