1312 search results - page 84 / 263 » Formally Optimal Boxing |
SAT
2004
Springer
14 years 2 months ago
2004
Springer
Linear Pseudo-Boolean constraints offer a much more compact formalism to express significant boolean problems in several areas, ranging from Artificial Intelligence to Electroni...
PKDD
2009
Springer
14 years 1 months ago
2009
Springer
Abstract. This paper focuses on Active Learning with a limited number of queries; in application domains such as Numerical Engineering, the size of the training set might be limite...
ICLP
2010
Springer
14 years 1 months ago
2010
Springer
Abstract. Reasoning about social networks (labeled, directed, weighted graphs) is becoming increasingly important and there are now models of how certain phenomena (e.g. adoption o...
ECAI
2006
Springer
13 years 11 months ago
2006
Springer
Propositional satisfiability (SAT) is a success story in Computer Science and Artificial Intelligence: SAT solvers are currently used to solve problems in many different applicati...
ECAI
2008
Springer
13 years 11 months ago
2008
Springer
Automation of Web service composition is one of the most interesting challenges facing the Semantic Web today. Since Web services have been enhanced with formal semantic descriptio...