2272 search results - page 70 / 455 » Capture Complexity by Partition |
104
click to vote
CONSTRAINTS
2008
14 years 10 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...
IPPS
1997
IEEE
15 years 2 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...
CODES
1994
IEEE
15 years 1 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...
GBRPR
2009
Springer
14 years 7 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...
ICAS
2006
IEEE
15 years 3 months 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 ...