Sciweavers

11328 search results - page 1984 / 2266
» Timed Branching Processes
Sort
View
202
Voted
MM
2005
ACM
371views Multimedia» more  MM 2005»
15 years 9 months ago
Data grid for large-scale medical image archive and analysis
Storage and retrieval technology for large-scale medical image systems has matured significantly during the past ten years but many implementations still lack cost-effective backu...
H. K. Huang, Aifeng Zhang, Brent J. Liu, Zheng Zho...
SAC
2005
ACM
15 years 9 months ago
Automatic extraction of informative blocks from webpages
Search engines crawl and index webpages depending upon their informative content. However, webpages — especially dynamically generated ones — contain items that cannot be clas...
Sandip Debnath, Prasenjit Mitra, C. Lee Giles
SPAA
2005
ACM
15 years 9 months ago
Value-maximizing deadline scheduling and its application to animation rendering
We describe a new class of utility-maximization scheduling problem with precedence constraints, the disconnected staged scheduling problem (DSSP). DSSP is a nonpreemptive multipro...
Eric Anderson, Dirk Beyer 0002, Kamalika Chaudhuri...
BIRTHDAY
2005
Springer
15 years 9 months ago
Planning in Answer Set Programming using Ordered Task Decomposition
abstract. In this paper we investigate a formalism for solving planning problems based on ordered task decomposition using Answer Set Programming (ASP). Our planning methodology is...
Jürgen Dix, Ugur Kuter, Dana S. Nau
CEEMAS
2005
Springer
15 years 9 months ago
The "Dance or Work" Problem: Why Do not all Honeybees Dance with Maximum Intensity
A honeybee colony has to choose among several nectar sources in the environment, each fluctuating in quality over time. Successful forager bees return to the hive and perform dance...
Ronald Thenius, Thomas Schmickl, Karl Crailsheim
« Prev « First page 1984 / 2266 Last » Next »