Sciweavers

15792 search results - page 2638 / 3159
» Computational Abstraction Steps
Sort
View
CADE
2004
Springer
16 years 7 months ago
Automatic Generation of Classification Theorems for Finite Algebras
Abstract. Classifying finite algebraic structures has been a major motivation behind much research in pure mathematics. Automated techniques have aided in this process, but this ha...
Simon Colton, Andreas Meier, Volker Sorge, Roy L. ...
STOC
2007
ACM
101views Algorithms» more  STOC 2007»
16 years 7 months ago
Toward a general theory of quantum games
We study properties of quantum strategies, which are complete specifications of a given party's actions in any multiple-round interaction involving the exchange of quantum in...
Gus Gutoski, John Watrous
STOC
2004
ACM
126views Algorithms» more  STOC 2004»
16 years 7 months ago
Bypassing the embedding: algorithms for low dimensional metrics
The doubling dimension of a metric is the smallest k such that any ball of radius 2r can be covered using 2k balls of raThis concept for abstract metrics has been proposed as a na...
Kunal Talwar
ICALP
2009
Springer
16 years 7 months ago
Smoothed Analysis of Balancing Networks
Abstract In a load balancing network each processor has an initial collection of unit-size jobs, tokens, and in each round, pairs of processors connected by balancers split their l...
Tobias Friedrich, Thomas Sauerwald, Dan Vilenchik
SIGMOD
2005
ACM
124views Database» more  SIGMOD 2005»
16 years 7 months ago
Simplifying construction of complex workflows for non-expert users of the Southern California Earthquake Center Community Modeli
: Workflow systems often present the user with rich interfaces that express all the capabilities and complexities of the application programs and the computing environments that th...
Philip Maechling, Hans Chalupsky, Maureen Doughert...
« Prev « First page 2638 / 3159 Last » Next »