Sciweavers

4103 search results - page 257 / 821
» Some results on the Collatz problem
Sort
View
CN
2004
102views more  CN 2004»
15 years 6 months ago
A mathematical model of the Paris Metro Pricing scheme for charging packet networks
Pricing has become one of the main challenges of the networking community and is receiving a great deal of interest in the literature. In this paper, we analyze the so-called Pari...
David Ros, Bruno Tuffin
JSA
2000
175views more  JSA 2000»
15 years 6 months ago
Complete worst-case execution time analysis of straight-line hard real-time programs
In this article, the problem of finding a tight estimate on the worst-case execution time (WCET) of a real-time program is addressed. The analysis is focused on straight-line code...
Friedhelm Stappert, Peter Altenbernd
IJCV
1998
233views more  IJCV 1998»
15 years 6 months ago
A Level-Set Approach to 3D Reconstruction from Range Data
This paper presents a method that uses the level sets of volumes to reconstruct the shapes of 3D objects from range data. The strategy is to formulate 3D reconstruction as a stati...
Ross T. Whitaker
AAAI
2007
15 years 9 months ago
Understanding Performance Tradeoffs in Algorithms for Solving Oversubscribed Scheduling
In recent years, planning and scheduling research has paid increasing attention to problems that involve resource oversubscription, where cumulative demand for resources outstrips...
Laurence A. Kramer, Laura Barbulescu, Stephen F. S...
PODS
2007
ACM
171views Database» more  PODS 2007»
16 years 7 months ago
Monadic datalog over finite structures with bounded treewidth
Bounded treewidth and Monadic Second Order (MSO) logic have proved to be key concepts in establishing fixed-parameter tractability results. Indeed, by Courcelle's Theorem we ...
Georg Gottlob, Reinhard Pichler, Fang Wei