3946 search results - page 563 / 790 » The computational complexity of choice sets |
237
click to vote
ICDCS
2012
IEEE
13 years 9 months ago
2012
IEEE
—Name-based route lookup is a key function for Named Data Networking (NDN). The NDN names are hierarchical and have variable and unbounded lengths, which are much longer than IPv...
206
click to vote
SC
2009
ACM
16 years 1 months ago
2009
ACM
Scientific workflow tools allow users to specify complex computational experiments and provide a good framework for robust science and engineering. Workflows consist of pipelines ...
146
click to vote
DIS
2003
Springer
15 years 12 months ago
2003
Springer
Computing abductive explanations is an important problem, which has been studied extensively in Artificial Intelligence (AI) and related disciplines. While computing some abductiv...
176
Voted
HPDC
1998
IEEE
15 years 11 months ago
1998
IEEE
Abstract Metacomputing is the seamless application of geographically-separated distributed computing resources to user applications. We consider the scheduling of metaapplications;...
173
click to vote
SIGGRAPH
1996
ACM
15 years 10 months ago
1996
ACM
An important, largely unexplored area of computer image generation is the simulation of weathering and its effects on appearance. Weathering results from the interaction of the en...