881 search results - page 84 / 177 » Solving satisfiability problems with preferences |
MICAI
2004
Springer
14 years 2 months ago
2004
Springer
A number of problems in computer science can be solved efficiently with the so called memory based or kernel methods. Among this problems (relevant to the AI community) are multime...
GD
2006
Springer
14 years 14 days ago
2006
Springer
Graph drawing research traditionally focuses on producing geometric embeddings of graphs satisfying various aesthetic constraints. However additional work must still be done to dra...
ATVA
2010
Springer
13 years 9 months ago
2010
Springer
This paper proposes a method for automatically inserting check statements for access control into a given recursive program according to a given security specification. A history-b...
ICASSP
2010
IEEE
13 years 9 months ago
2010
IEEE
— Ergodic stochastic optimization (ESO) algorithms are proposed to solve resource allocation problems that involve a random state and where optimality criteria are expressed in t...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
Solving stochastic optimization problems under partial observability, where one needs to adaptively make decisions with uncertain outcomes, is a fundamental but notoriously diffic...