Sciweavers

4313 search results - page 524 / 863
» Using time travel to diagnose computer problems
Sort
View
SIGGRAPH
2000
ACM
15 years 11 months ago
Out-of-core simplification of large polygonal models
We present an algorithm for out-of-core simplification of large polygonal datasets that are too complex to fit in main memory. The algorithm extends the vertex clustering scheme o...
Peter Lindstrom
ATAL
2008
Springer
15 years 9 months ago
Demonstration of multi-agent potential fields in real-time strategy games
Bots for Real Time Strategy (RTS) games provide a rich challenge to implement. A bot controls a number of units that may have to navigate in a partially unknown environment, while...
Johan Hagelbäck, Stefan J. Johansson
DCOSS
2008
Springer
15 years 9 months ago
Efficient Node Discovery in Mobile Wireless Sensor Networks
Energy is one of the most crucial aspects in real deployments of mobile sensor networks. As a result of scarce resources, the duration of most real deployments can be limited to ju...
Vladimir Dyo, Cecilia Mascolo
RECOMB
1997
Springer
15 years 11 months ago
A branch-and-cut algorithm for multiple sequence alignment
Multiple sequence alignment is an important problem in computational biology. We study the Maximum Trace formulation introduced by Kececioglu [?]. We first phrase the problem in ...
Knut Reinert, Hans-Peter Lenhof, Petra Mutzel, Kur...
FSTTCS
1992
Springer
15 years 11 months ago
Structural Average Case Complexity
Levin introduced an average-case complexity measure, based on a notion of \polynomialon average," and de ned \average-case polynomial-time many-one reducibility" amongra...
Rainer Schuler, Tomoyuki Yamakami