1686 search results - page 303 / 338 » Programs as polygraphs: computability and complexity |
DAM
2007
13 years 11 months ago
2007
In 1997 Lampert and Slater introduced parallel knock-out schemes, an iterative process on graphs that goes through several rounds. In each round of this process, every vertex elim...
CG
2000
Springer
13 years 10 months ago
2000
Springer
In this paper we present a sketch modelling system which we call Stilton. The program resembles a desktop VRML browser, allowing a user to navigate a 3D model in a perspective pro...
CN
2000
13 years 10 months ago
2000
Simulation offers significant advantages as a basis for academic projects in computer networking. many unimportant details can be abstracted away, and also because simulations can...
ATAL
2007
Springer
14 years 5 months ago
2007
Springer
Distributed Constraint Optimization (DCOP) is a general framework that can model complex problems in multi-agent systems. Several current algorithms that solve general DCOP instan...
IWVF
2001
Springer
14 years 3 months ago
2001
Springer
Volumetric images of small mortar samples under load are acquired by X-ray microtomography. The images are binarized at many different threshold values, and over a million connecte...