Sciweavers

14704 search results - page 424 / 2941
» computing 2007
Sort
View
120
Voted
COCO
2007
Springer
75views Algorithms» more  COCO 2007»
15 years 11 months ago
On the Theory of Matchgate Computations
Valiant has proposed a new theory of algorithmic computation based on perfect matchings and Pfaffians. We study the properties of matchgates—the basic building blocks in this n...
Jin-yi Cai, Vinay Choudhary, Pinyan Lu
JSSPP
2007
Springer
15 years 11 months ago
Prospects of Collaboration between Compute Providers by Means of Job Interchange
Abstract. This paper empirically explores the advantages of the collaboration between different parallel compute sites in a decentralized grid scenario. To this end, we assume ind...
Christian Grimme, Joachim Lepping, Alexander Papas...
174
Voted
IIE
2007
154views more  IIE 2007»
15 years 4 months ago
Computer Aided Modelling Exercises
This paper describes a didactical Computer Aided Software Engineering (CASE)-tool that was developed for use within the context of a course in object-oriented domain modelling. In...
Monique Snoeck, Raf Haesen, Herman Buelens, Manu D...
163
Voted
CLIMA
2010
15 years 5 months ago
Is Computational Complexity a Barrier to Manipulation?
When agents are acting together, they may need a simple mechanism to decide on joint actions. One possibility is to have the agents express their preferences in the form of a ballo...
Toby Walsh
149
Voted
ESA
2007
Springer
155views Algorithms» more  ESA 2007»
15 years 8 months ago
Complete, Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangement of Quadrics
We present a complete, exact and efficient implementation to compute the adjacency graph of an arrangement of quadrics, i.e. surfaces of algebraic degree 2. This is a major step t...
Laurent Dupont, Michael Hemmer, Sylvain Petitjean,...