3907 search results - page 619 / 782 » Time, Knowledge, and Choice |
132
click to vote
STACS
2004
Springer
15 years 10 months ago
2004
Springer
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...
172
click to vote
VLDB
2004
ACM
15 years 10 months ago
2004
ACM
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...
150
click to vote
ICDCS
2003
IEEE
15 years 10 months ago
2003
IEEE
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...
157
click to vote
IEEEICCI
2003
IEEE
15 years 10 months ago
2003
IEEE
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...
150
click to vote
INFOCOM
2003
IEEE
15 years 10 months ago
2003
IEEE
— 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...