Sciweavers

27 search results - page 1 / 6
» Why Computational Complexity Requires Stricter Martingales
Sort
View
MST
2006
53views more  MST 2006»
13 years 4 months ago
Why Computational Complexity Requires Stricter Martingales
John M. Hitchcock, Jack H. Lutz
ECUMN
2007
Springer
13 years 11 months ago
Path Computation for Incoming Interface Multipath Routing
— Currently used IP routing protocols calculate and only use a single path between two nodes of a network, or in the best case, only paths with the same cost (with OSPF2 or IS-IS...
Pascal Mérindol, Jean-Jacques Pansiot, St&e...
DLOG
2011
12 years 8 months ago
The Complexity of Conjunctive Query Abduction in DL-Lite
In order to meet usability requirements, most logic-based applications provide explanation facilities for reasoning services. This holds also for DLs, where research focused on the...
Diego Calvanese, Magdalena Ortiz, Mantas Simkus, G...
HERCMA
2001
126views Mathematics» more  HERCMA 2001»
13 years 6 months ago
Why computerized models to control virtual Humans?
Interactive systems, games, VR and multimedia systems require more and more flexible Virtual Humans with individualities. There are mainly two approaches: 1) Recording the motion u...
Daniel Thalmann
EUROPAR
2003
Springer
13 years 10 months ago
Why Not Use a Pattern-Based Parallel Programming System?
Parallel programming is seen as an effective technique to improve the performance of computationally-intensive programs. This is done at the cost of increasing the complexity of t...
John Anvik, Jonathan Schaeffer, Duane Szafron, Kai...