Sciweavers

3657 search results - page 260 / 732
» A Study of Practical Deduplication
Sort
View
DS
1997
104views Database» more  DS 1997»
15 years 8 months ago
Managing Constraint Violations in Administrative Information Systems
This paper motivates a comprehensive methodological framework for dealing with some aspects of real-world complexity in information system analysis and design. By complex applicat...
I. Boydens, Alain Pirotte, Esteban Zimányi
GRAPHICSINTERFACE
1997
15 years 8 months ago
The Immediate Usability of Graffiti
We present four empirical measures of the immediate usability of Graffiti, a character recognizer for pen-based computers. Since speed is fully controlled by the user, we measured...
I. Scott MacKenzie, Shawn X. Zhang
C3S2E
2010
ACM
15 years 7 months ago
Scalable formula decomposition for propositional satisfiability
Propositional satisfiability solving, or SAT, is an important reasoning task arising in numerous applications, such as circuit design, formal verification, planning, scheduling or...
Anthony Monnet, Roger Villemaire
CLIMA
2010
15 years 6 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
DM
2010
102views more  DM 2010»
15 years 6 months ago
Covering graphs with matchings of fixed size
Let m be a positive integer and let G be a graph. We consider the question: can the edge set E(G) of G be expressed as the union of a set M of matchings of G each of which has siz...
David Cariolaro, Hung-Lin Fu