Sciweavers

1632 search results - page 203 / 327
» Sublinear Time Algorithms for Metric Space Problems
Sort
View
SIGGRAPH
2000
ACM
15 years 7 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
CEC
2007
IEEE
15 years 6 months ago
Fitness inheritance in evolutionary and multi-objective high-level synthesis
Abstract—The high-level synthesis process allows the automatic design and implementation of digital circuits starting from a behavioral description. Evolutionary algorithms are v...
Christian Pilato, Gianluca Palermo, Antonino Tumeo...
MASCOTS
2003
15 years 5 months ago
Minimizing Packet Loss by Optimizing OSPF Weights Using Online Simulation
In this paper, we present a scheme for minimizing packet loss in OSPF networks by optimizing link weights using Online Simulation. We have chosen packet loss rate in the network a...
Hema Tahilramani Kaur, Tao Ye, Shivkumar Kalyanara...
ERSHOV
2006
Springer
15 years 6 months ago
Well-Structured Model Checking of Multiagent Systems
Abstract. We address model checking problem for combination of Computation Tree Logic (CTL) and Propositional Logic of Knowledge (PLK) in finite systems with the perfect recall syn...
Nikolay V. Shilov, Natalya Olegovna Garanina
SPAA
2005
ACM
15 years 9 months ago
Dynamic circular work-stealing deque
The non-blocking work-stealing algorithm of Arora, Blumofe, and Plaxton (henceforth ABP work-stealing) is on its way to becoming the multiprocessor load balancing technology of ch...
David Chase, Yossi Lev