Sciweavers

550 search results - page 24 / 110
» Optimization and Approximation Problems Related to Polynomia...
Sort
View
PODS
2006
ACM
137views Database» more  PODS 2006»
14 years 9 months ago
Data exchange: computing cores in polynomial time
Data exchange deals with inserting data from one database into another database having a different schema. We study and solve a central computational problem of data exchange, nam...
Georg Gottlob, Alan Nash
ATAL
2005
Springer
14 years 2 months ago
A decentralized bargaining protocol on dependent continuous multi-issue for approximate pareto optimal outcomes
Negotiation techniques have been demonstrated to be effective in solving complex multi-objective problems. When the optimization process operates on continuous variables, it can b...
Nicola Gatti, Francesco Amigoni
JAIR
2008
126views more  JAIR 2008»
13 years 8 months ago
Optimal and Approximate Q-value Functions for Decentralized POMDPs
Decision-theoretic planning is a popular approach to sequential decision making problems, because it treats uncertainty in sensing and acting in a principled way. In single-agent ...
Frans A. Oliehoek, Matthijs T. J. Spaan, Nikos A. ...
DAM
2010
112views more  DAM 2010»
13 years 8 months ago
New results on optimizing rooted triplets consistency
Abstract. A set of phylogenetic trees with overlapping leaf sets is consistent if it can be merged without conflicts into a supertree. In this paper, we study the polynomial-time a...
Jaroslaw Byrka, Sylvain Guillemot, Jesper Jansson
DAC
1998
ACM
14 years 9 months ago
Policy Optimization for Dynamic Power Management
Dynamic power management schemes (also called policies) can be used to control the power consumption levels of electronic systems, by setting their components in different states,...
Giuseppe A. Paleologo, Luca Benini, Alessandro Bog...