2976 search results - page 381 / 596 » On the bounded integer programming |
138
click to vote
ICALP
2004
Springer
15 years 9 months ago
2004
Springer
We consider the problem of learning a labeled graph from a given family of graphs on n vertices in a model where the only allowed operation is to query whether a set of vertices i...
119
click to vote
ISIPTA
2003
IEEE
15 years 9 months ago
2003
IEEE
A generalization of deFinetti’s Fundamental Theorem of Probability facilitates coherent assessment, by iterated natural extension, of imprecise probabilities or expectations, co...
135
click to vote
CDC
2009
IEEE
15 years 9 months ago
2009
IEEE
— The problem of finding an optimal path in an uncertain graph arises in numerous applications, including network routing, path-planning for vehicles, and the control of finite...
147
click to vote
AAAI
2008
15 years 6 months ago
2008
Decentralized Markov Decision Processes are a powerful general model of decentralized, cooperative multi-agent problem solving. The high complexity of the general problem leads to...
145
click to vote
DAC
2005
ACM
15 years 6 months ago
2005
ACM
Layout parasitics have great impact on analog circuit performance. This paper presents an algorithm for explicit parasitic control during layout retargeting of analog integrated c...