Sciweavers

5210 search results - page 1012 / 1042
» Exact geometric computation
Sort
View
EMSOFT
2007
Springer
14 years 2 months ago
Loosely time-triggered architectures based on communication-by-sampling
We address the problem of mapping a set of processes which communicate synchronously on a distributed platform. The Time Triggered Architecture (TTA) proposed by Kopetz for the co...
Albert Benveniste, Paul Caspi, Marco Di Natale, Cl...
ICDM
2006
IEEE
166views Data Mining» more  ICDM 2006»
14 years 2 months ago
Mining Generalized Graph Patterns Based on User Examples
There has been a lot of recent interest in mining patterns from graphs. Often, the exact structure of the patterns of interest is not known. This happens, for example, when molecu...
Pavel Dmitriev, Carl Lagoze
SYNASC
2006
IEEE
103views Algorithms» more  SYNASC 2006»
14 years 2 months ago
Incremental Deterministic Planning
We present a new planning algorithm that formulates the planning problem as a counting satisfiability problem in which the number of available solutions guides the planner determ...
Stefan Andrei, Wei-Ngan Chin, Martin C. Rinard
MSWIM
2006
ACM
14 years 2 months ago
Establishing how many VoIP calls a wireless LAN can support without performance degradation
The use of Voice IP (VoIP) over wireless local area networks (WLAN) is a topic of great interest in the research arena. This paper attempts to answer the question: how many VoIP c...
Ángel Cuevas Rumín, Eur Ing Chris Gu...
SIGCOMM
2006
ACM
14 years 2 months ago
Systematic topology analysis and generation using degree correlations
Researchers have proposed a variety of metrics to measure important graph properties, for instance, in social, biological, and computer networks. Values for a particular graph met...
Priya Mahadevan, Dmitri V. Krioukov, Kevin R. Fall...
« Prev « First page 1012 / 1042 Last » Next »