Sciweavers

3907 search results - page 619 / 782
» Time, Knowledge, and Choice
Sort
View
STACS
2004
Springer
14 years 4 months ago
Algorithms for SAT Based on Search in Hamming Balls
We present two simple algorithms for SAT and prove upper bounds on their running time. Given a Boolean formula F in conjunctive normal form, the first algorithm finds a satisfyin...
Evgeny Dantsin, Edward A. Hirsch, Alexander Wolper...
VLDB
2004
ACM
124views Database» more  VLDB 2004»
14 years 4 months ago
Containment of Nested XML Queries
Query containment is the most fundamental relationship between a pair of database queries: a query Q is said to be contained in a query Q if the answer for Q is always a subset of...
Xin Dong, Alon Y. Halevy, Igor Tatarinov
ICDCS
2003
IEEE
14 years 4 months ago
Decision-Support Workload Characteristics on a Clustered Database Server from the OS Perspective
A range of database services are being offered on clusters of workstations today to meet the demanding needs of applications with voluminous datasets, high computational and I/O r...
Yanyong Zhang, Jianyong Zhang, Anand Sivasubramani...
IEEEICCI
2003
IEEE
14 years 4 months ago
Conceptual Framework for Interactive Ontology Building
Abstract— An ontology is a formal language adequately representing the knowledge used for reasoning in a specific environment. When contradictions arise and make ontologies inad...
Jean Sallantin, Jacques Divol, Patrice Duroux
INFOCOM
2003
IEEE
14 years 4 months ago
Modeling the Spread of Active Worms
— Active worms spread in an automated fashion and can flood the Internet in a very short time. Modeling the spread of active worms can help us understand how active worms spread...
Zesheng Chen, Lixin Gao, Kevin A. Kwiat