Sciweavers

12052 search results - page 2172 / 2411
» computer 2010
Sort
View
GIS
2010
ACM
13 years 9 months ago
Decentralized querying of topological relations between regions without using localization
This paper proposes an efficient, decentralized algorithm for determining the topological relationship between two regions monitored by a geosensor network. Many centralized algo...
Matt Duckham, Myeong Hun Jeong, Sanjiang Li, Joche...
IGPL
2010
161views more  IGPL 2010»
13 years 9 months ago
Extending the Hegselmann-Krause Model I
Hegselmann and Krause have developed a simple yet powerful computational model for studying the opinion dynamics in societies of epistemically interacting truth-seeking agents. We...
Igor Douven, Alexander Riegler
IJHPCA
2010
105views more  IJHPCA 2010»
13 years 9 months ago
A Pipelined Algorithm for Large, Irregular All-Gather Problems
We describe and evaluate a new, pipelined algorithm for large, irregular all-gather problems. In the irregular all-gather problem each process in a set of processes contributes in...
Jesper Larsson Träff, Andreas Ripke, Christia...
RV
2010
Springer
177views Hardware» more  RV 2010»
13 years 9 months ago
Runtime Instrumentation for Precise Flow-Sensitive Type Analysis
We describe a combination of runtime information and static analysis for checking properties of complex and configurable systems. The basic idea of our approach is to 1) let the p...
Etienne Kneuss, Philippe Suter, Viktor Kuncak
SAS
2010
Springer
140views Formal Methods» more  SAS 2010»
13 years 9 months ago
Multi-dimensional Rankings, Program Termination, and Complexity Bounds of Flowchart Programs
Abstract. Proving the termination of a flowchart program can be done by exhibiting a ranking function, i.e., a function from the program states to a wellfounded set, which strictl...
Christophe Alias, Alain Darte, Paul Feautrier, Lau...
« Prev « First page 2172 / 2411 Last » Next »