4117 search results - page 148 / 824 » On the Satisfiability of Complex Constraints |
189
click to vote
MP
2011
15 years 1 months ago
2011
We perform a smoothed analysis of Renegar’s condition number for linear programming by analyzing the distribution of the distance to ill-posedness of a linear program subject to...
145
click to vote
AIIA
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. The O-OSCAR software architecture is a problem solving environment for complex scheduling problem that is based on a constraintbased representation. On top of this core r...
169
click to vote
CIAC
2010
Springer
16 years 3 months ago
2010
Springer
Abstract. Given a binary dominance relation on a set of alternatives, a common thread in the social sciences is to identify subsets of alternatives that satisfy certain notions of ...
185
click to vote
FQAS
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. The task of similarity search is widely used in various areas of computing, including multimedia databases, data mining, bioinformatics, social networks, etc. For a long ...
159
click to vote
SEMWEB
2005
Springer
15 years 12 months ago
2005
Springer
This paper extends the model theory of RDF with rules, placing an emphasis on integration with OWL and decidability of entailstart from an abstract syntax that views a rule as a pa...