Sciweavers

828 search results - page 118 / 166
» Bounded Hairpin Completion
Sort
View
SIGGRAPH
2010
ACM
14 years 2 months ago
Filament-based smoke with vortex shedding and variational reconnection
Simulating fluids based on vortex filaments is highly attractive for the creation of special effects because it gives artists full control over the simulation using familiar too...
Steffen Weißmann, Ulrich Pinkall
DATE
1999
IEEE
134views Hardware» more  DATE 1999»
14 years 2 months ago
Verifying Imprecisely Working Arithmetic Circuits
If real number calculations are implemented as circuits, only a limited preciseness can be obtained. Hence, formal verification can not be used to prove the equivalence between th...
Michaela Huhn, Klaus Schneider, Thomas Kropf, Geor...
SWAT
1998
Springer
108views Algorithms» more  SWAT 1998»
14 years 2 months ago
Formal Language Constrained Path Problems
Given an alphabet , a (directed) graph G whose edges are weighted and -labeled, and a formal language L , the formal-language-constrained shortest/simple path problem consists of ...
Christopher L. Barrett, Riko Jacob, Madhav V. Mara...
WG
1998
Springer
14 years 2 months ago
Triangles in Euclidean Arrangements
The number of triangles in arrangements of lines and pseudolines has been object of some research. Most results, however, concern arrangements in the projective plane. In this arti...
Stefan Felsner, Klaus Kriegel
ATAL
1997
Springer
14 years 2 months ago
Approximate Reasoning about Combined Knowledge
Abstract. Just as cooperation in multi-agent systems is a central issue for solving complex tasks, so too is the ability for an intelligent agent to reason about combined knowledge...
Frédéric Koriche