Sciweavers

937 search results - page 168 / 188
» On the Complexity of Partial Order Properties
Sort
View
COMPGEOM
2004
ACM
15 years 3 months ago
Low-dimensional embedding with extra information
A frequently arising problem in computational geometry is when a physical structure, such as an ad-hoc wireless sensor network or a protein backbone, can measure local information...
Mihai Badoiu, Erik D. Demaine, Mohammad Taghi Haji...
ESAW
2004
Springer
15 years 3 months ago
Techniques for Analysis and Calibration of Multi-agent Simulations
In this paper we present analysis and calibration techniques that exploit knowledge about a multi agent society in order to calibrate the system parameters of a corresponding socie...
Manuel Fehler, Franziska Klügl, Frank Puppe
CIAC
2003
Springer
98views Algorithms» more  CIAC 2003»
15 years 3 months ago
Improving Customer Proximity to Railway Stations
Abstract. We consider problems of (new) station placement along (existing) railway tracks, so as to increase the number of users. We prove that, in spite of the NP-hardness for the...
Evangelos Kranakis, Paolo Penna, Konrad Schlude, D...
SIGGRAPH
2000
ACM
15 years 2 months ago
Adaptively sampled distance fields: a general representation of shape for computer graphics
Adaptively Sampled Distance Fields (ADFs) are a unifying representation of shape that integrate numerous concepts in computer graphics including the representation of geometry and...
Sarah F. Frisken Gibson, Ronald N. Perry, Alyn P. ...
CONCUR
2000
Springer
15 years 2 months ago
The Control of Synchronous Systems
In the synchronous composition of processes, one process may prevent another process from proceeding unless compositions without a wellde ned productbehavior are ruled out. They ca...
Luca de Alfaro, Thomas A. Henzinger, Freddy Y. C. ...