Sciweavers

1547 search results - page 146 / 310
» Solving Knapsack Problems in a Sticker Based Model
Sort
View
114
Voted
NOMS
2008
IEEE
15 years 10 months ago
A novel approach to bottleneck analysis in networks
—In this paper∗ , we devise a novel method for bottleneck analysis of UDP networks based on the concept of network utility maximization. To determine the losses on the links in...
Nikhil Shetty, Assane Gueye, Jean C. Walrand
117
Voted
ICDT
2007
ACM
118views Database» more  ICDT 2007»
15 years 7 months ago
Approximate Data Exchange
Abstract. We introduce approximate data exchange, by relaxing classical data exchange problems such as Consistency and Typechecking to their approximate versions based on Property ...
Michel de Rougemont, Adrien Vieilleribière
145
Voted
MICCAI
2003
Springer
16 years 4 months ago
Establishing Local Correspondences towards Compact Representations of Anatomical Structures
Computer-aided diagnosis is often based on comparing a structure of interest with prior models. Such a comparison requires automatic techniques in determining prior models from a s...
Xiaolei Huang, Nikos Paragios, Dimitris N. Metaxas
135
Voted
ICRA
2008
IEEE
173views Robotics» more  ICRA 2008»
15 years 10 months ago
Bayesian reinforcement learning in continuous POMDPs with application to robot navigation
— We consider the problem of optimal control in continuous and partially observable environments when the parameters of the model are not known exactly. Partially Observable Mark...
Stéphane Ross, Brahim Chaib-draa, Joelle Pi...
105
Voted
AIPS
1998
15 years 5 months ago
Encoding HTN Planning in Propositional Logic
Casting planning problems as propositional satis ability problems has recently been shown to be an effective way of scaling up plan synthesis. Until now, the bene ts of this appro...
Amol Dattatraya Mali, Subbarao Kambhampati