Sciweavers

1095 search results - page 210 / 219
» Efficient Algorithms for Average Completion Time Scheduling
Sort
View
DATE
2008
IEEE
145views Hardware» more  DATE 2008»
15 years 4 months ago
Minimizing Virtual Channel Buffer for Routers in On-chip Communication Architectures
We present a novel methodology for design space exploration using a two-steps scheme to optimize the number of virtual channel buffers (buffers take the premier share of the route...
Mohammad Abdullah Al Faruque, Jörg Henkel
JCDL
2005
ACM
100views Education» more  JCDL 2005»
15 years 3 months ago
What's there and what's not?: focused crawling for missing documents in digital libraries
Some large scale topical digital libraries, such as CiteSeer, harvest online academic documents by crawling open-access archives, university and author homepages, and authors’ s...
Ziming Zhuang, Rohit Wagle, C. Lee Giles
SIGGRAPH
1994
ACM
15 years 1 months ago
Zippered polygon meshes from range images
Range imaging offers an inexpensive and accurate means for digitizing the shape of three-dimensional objects. Because most objects self occlude, no single range image suffices to ...
Greg Turk, Marc Levoy
GECCO
2008
Springer
145views Optimization» more  GECCO 2008»
14 years 10 months ago
Memory with memory: soft assignment in genetic programming
Based in part on observations about the incremental nature of most state changes in biological systems, we introduce the idea of Memory with Memory in Genetic Programming (GP), wh...
Nicholas Freitag McPhee, Riccardo Poli
72
Voted
ATAL
2010
Springer
14 years 10 months ago
Incremental plan aggregation for generating policies in MDPs
Despite the recent advances in planning with MDPs, the problem of generating good policies is still hard. This paper describes a way to generate policies in MDPs by (1) determiniz...
Florent Teichteil-Königsbuch, Ugur Kuter, Gui...