Sciweavers

17049 search results - page 280 / 3410
» cans 2007
Sort
View
CLIMA
2004
15 years 8 months ago
Fault Tolerant and Fixed Scalable Structure of Middle-Agents
Middle-agents are used by end-agents to locate service providers in multi-agent systems. One central middle-agent represents a single point of failure and communication bottleneck ...
Pavel Tichý
CATS
2006
15 years 8 months ago
Combinatorial Generation by Fusing Loopless Algorithms
Some combinatorial generation problems can be broken into subproblems for which loopless algorithms already exist. We discuss means by which loopless algorithms can be fused to pr...
Tadao Takaoka, Stephen Violich
150
Voted
CCCG
2006
15 years 8 months ago
On Bipartite Matching under the RMS Distance
Given two sets A and B of n points each in R2 , we study the problem of computing a matching between A and B that minimizes the root mean square (rms) distance of matched pairs. W...
Jeff M. Phillips, Pankaj K. Agarwal
CDES
2006
136views Hardware» more  CDES 2006»
15 years 8 months ago
Using Task Recomputation During Application Mapping in Parallel Embedded Architectures
- Many memory-sensitive embedded applications can tolerate small performance degradations if doing so can reduce the memory space requirements significantly. This paper explores th...
Suleyman Tosun, Mahmut T. Kandemir, Hakduran Koc
CGVR
2006
15 years 8 months ago
Real-time Computation of Area Shadows - A Geometrical Algorithm
The computation of soft shadows created by area light sources is a well-known problem in computer graphics. Due to the complexity of the problem, soft shadows commonly are generat...
Michael Boehl, Wolfgang Stürzlinger