Sciweavers

1594 search results - page 196 / 319
» An Algorithm to Compute Collusion Paths
Sort
View
119
Voted
WG
1998
Springer
15 years 7 months ago
Linear Time Solvable Optimization Problems on Graphs of Bounded Clique Width
Hierarchical decompositions of graphs are interesting for algorithmic purposes. There are several types of hierarchical decompositions. Tree decompositions are the best known ones....
Bruno Courcelle, Johann A. Makowsky, Udi Rotics
118
Voted
RT
2000
Springer
15 years 7 months ago
Metropolis Light Transport for Participating Media
Abstract. In this paper we show how Metropolis Light Transport can be extended both in the underlying theoretical framework and the algorithmic implementation to incorporate volume...
Mark Pauly, Thomas Kollig, Alexander Keller
127
Voted
AROBOTS
2005
100views more  AROBOTS 2005»
15 years 3 months ago
A Sampling-Based Motion Planning Approach to Maintain Visibility of Unpredictable Targets
This paper deals with the surveillance problem of computing the motions of one or more robot observers in order to maintain visibility of one or several moving targets. The target...
Rafael Murrieta-Cid, Benjamín Tovar, Seth H...
139
Voted
APIN
2000
103views more  APIN 2000»
15 years 3 months ago
Probabilistic Pattern Matching and the Evolution of Stochastic Regular Expressions
The use of genetic programming for probabilistic pattern matching is investigated. A stochastic regular expression language is used. The language features a statistically sound sem...
Brian J. Ross
273
Voted
ARITH
2011
IEEE
14 years 3 months ago
Fast Ripple-Carry Adders in Standard-Cell CMOS VLSI
— This paper presents a number of new high-radix ripple-carry adder designs based on Ling’s addition technique and a recently-published expansion thereof. The proposed adders a...
Neil Burgess