Sciweavers

4313 search results - page 586 / 863
» Using time travel to diagnose computer problems
Sort
View
LPNMR
2005
Springer
16 years 29 days ago
Revisiting the Semantics of Interval Probabilistic Logic Programs
Two approaches to logic programming with probabilities emerged over time: bayesian reasoning and probabilistic satisfiability (PSAT). The attractiveness of the former is in tying ...
Alex Dekhtyar, Michael I. Dekhtyar
WADS
2005
Springer
132views Algorithms» more  WADS 2005»
16 years 28 days ago
k-Link Shortest Paths in Weighted Subdivisions
We study the shortest path problem in weighted polygonal subdivisions of the plane, with the additional constraint of an upper bound, k, on the number of links (segments) in the pa...
Ovidiu Daescu, Joseph S. B. Mitchell, Simeon C. Nt...
211
Voted
ICNP
1999
IEEE
15 years 11 months ago
Dynamic Memory Model Based Framework for Optimization of IP Address Lookup Algorithms
The design of software-based algorithms for fast IP address lookup targeted for general purpose processors has received tremendous attention in recent years due to its low cost im...
Gene Cheung, Steven McCanne
DAGSTUHL
2004
15 years 8 months ago
Simplicity Considered Fundamental to Design for Predictability
Complexity is the core problem of contemporary information technology, as the "artificial complicatedness" of its artefacts is exploding. Intellectually easy and economic...
Wolfgang A. Halang
EVOW
2008
Springer
15 years 8 months ago
Particle Swarm Optimization for Tackling Continuous Review Inventory Models
We propose an alternative algorithm for solving continuous review inventory model problems for deteriorating items over a finite horizon. Our interest focuses on the case of time...
Konstantinos E. Parsopoulos, K. Skouri, Michael N....