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 ...
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...
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...
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...
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...