Sciweavers

15375 search results - page 278 / 3075
» cans 2008
Sort
View
JSAT
2008
85views more  JSAT 2008»
13 years 8 months ago
Parallel SAT Solving using Bit-level Operations
We show how to exploit the 32/64 bit architecture of modern computers to accelerate some of the algorithms used in satisfiability solving by modifying assignments to variables in ...
Marijn Heule, Hans van Maaren
DEBU
2007
75views more  DEBU 2007»
13 years 8 months ago
Thinking Big About Tiny Databases
Work on early tiny database systems, like TinyDB [17] and Cougar [23] has shown that a declarative approach can provide a powerful and easy to use interface for collecting data fr...
Michael J. Franklin, Joseph M. Hellerstein, Samuel...
DKE
2007
101views more  DKE 2007»
13 years 8 months ago
Parameterized pattern queries
We introduce parameterized pattern queries as a new paradigm to extend traditional pattern expressions over sequence databases. A parameterized pattern is essentially a string mad...
Cédric du Mouza, Philippe Rigaux, Michel Sc...
JSW
2008
89views more  JSW 2008»
13 years 8 months ago
Secure Set Union and Bag Union Computation for Guaranteeing Anonymity of Distrustful Participants
Abstract-- The computation of the union operator for different distributed datasets involves two challenges when participants are curious and can even act malicious: guaranteeing a...
Stefan Böttcher, Sebastian Obermeier
JSW
2008
105views more  JSW 2008»
13 years 8 months ago
Reasoning Principles for Negotiating Agent
Automated negotiation is an important applying field of agent theory and technology. For the current agent theoretical models have some troubles in explaining the agent's nego...
Mukun Cao, Yuqiang Feng