Sciweavers

5114 search results - page 294 / 1023
» Complex networks
Sort
View
149
Voted
AAAI
2011
14 years 3 months ago
Complete Information Pursuit Evasion in Polygonal Environments
Suppose an unpredictable evader is free to move around in a polygonal environment of arbitrary complexity that is under full camera surveillance. How many pursuers, each with the ...
Kyle Klein, Subhash Suri
152
Voted
EGPGV
2004
Springer
165views Visualization» more  EGPGV 2004»
15 years 9 months ago
Tuning of Algorithms for Independent Task Placement in the Context of Demand-Driven Parallel Ray Tracing
This paper investigates assignment strategies (load balancing algorithms) for process farms which solve the problem of online placement of a constant number of independent tasks w...
Tomas Plachetka
131
Voted
ICIP
2002
IEEE
16 years 5 months ago
Optimal protection assignment for scalable compressed images
This paper is concerned with the efficient transmission of scalable compressed images over lossy communication channels. Recent works have proposed several strategies for assignin...
Johnson Thie, David Taubman
116
Voted
JCB
2006
114views more  JCB 2006»
15 years 3 months ago
A General Modeling Strategy for Gene Regulatory Networks with Stochastic Dynamics
A stochastic genetic toggle switch model that consists of two identical, mutually repressive genes is built using the Gillespie algorithm with time delays as an example of a simpl...
Andre Ribeiro, Rui Zhu, Stuart A. Kauffman
107
Voted
MOBIHOC
2003
ACM
16 years 3 months ago
Worst-Case optimal and average-case efficient geometric ad-hoc routing
In this paper we present GOAFR, a new geometric ad-hoc routing algorithm combining greedy and face routing. We evaluate this algorithm by both rigorous analysis and comprehensive ...
Fabian Kuhn, Roger Wattenhofer, Aaron Zollinger