Sciweavers

6562 search results - page 306 / 1313
» Noetherianity and Combination Problems
Sort
View
IJCAI
2003
15 years 8 months ago
A Maximal Tractable Class of Soft Constraints
Many optimization problems can be expressed us­ ing some form of soft constraints, where different measures of desirability arc associated with differ­ ent combinations of domai...
David A. Cohen, Martin C. Cooper, Peter Jeavons, A...
WIIW
2001
107views more  WIIW 2001»
15 years 8 months ago
Multifaceted Exploitation of Metadata for Attribute Match Discovery in Information Integration
Automating semantic matching of attributes for the purpose of information integration is challenging, and the dynamics of the Web further exacerbate this problem. Believing that m...
David W. Embley, David Jackman, Li Xu
SODA
1998
ACM
114views Algorithms» more  SODA 1998»
15 years 8 months ago
Exact Arithmetic at Low Cost - A Case Study in Linear Programming
We describe a new exact-arithmetic approach to linear programming when the number of variables n is much larger than the number of constraints m (or vice versa). The algorithm is ...
Bernd Gärtner
FORTE
1996
15 years 8 months ago
Applications of Fair Testing
In this paper we present the application of the fair testing pre-order, introduced in a previous paper, to the speci cation and analysis of distributed systems. This pre-order com...
Ed Brinksma, Arend Rensink, Walter Vogler
AAAI
1990
15 years 7 months ago
An Approach to Reasoning About Continuous Change for Applications in Planning
There are many planning applications that require an agent to coordinate its activities with processes that change continuously over time. Several proposals have been made for com...
Thomas Dean, Greg Siegle