Sciweavers

687 search results - page 39 / 138
» On The Complexity of Manipulating Elections
Sort
View
IPPS
1996
IEEE
14 years 2 days ago
Commutativity Analysis: A Technique for Automatically Parallelizing Pointer-Based Computations
This paper introduces an analysis technique, commutativity analysis, for automatically parallelizing computations that manipulate dynamic, pointer-based data structures. Commutati...
Martin C. Rinard, Pedro C. Diniz
CISIS
2010
IEEE
14 years 2 months ago
On a Journey from Message to Observable Pervasive Application
—Bringing together heterogeneous computing devices and appliances gives rise to a spontaneous environment where resources exchange messages, such as a mobile phone telling the ca...
Geert Vanderhulst, Kris Luyten, Karin Coninx
AGTIVE
2007
Springer
14 years 2 months ago
Applying a Grouping Operator in Model Transformations
The usability of model transformation languages depends on the abstractions one can work with in rules to perform complex operations on models. Recently, we have introduced a novel...
Daniel Balasubramanian, Anantha Narayanan, Sandeep...
EXPERT
2006
66views more  EXPERT 2006»
13 years 8 months ago
Representation as a Fluent: An AI Challenge for the Next Half Century
We argue that artificial intelligence systems must be able to manipulate their own internal representations automatically in order to deal with an infinitely complex and ever chan...
Alan Bundy, Fiona McNeill
STOC
2010
ACM
200views Algorithms» more  STOC 2010»
14 years 5 months ago
Hardness Amplification in Proof Complexity
We present a generic method for converting any family of unsatisfiable CNF formulas that require large resolution rank into CNF formulas whose refutation requires large rank for p...
Paul Beame, Trinh Huynh and Toniann Pitassi