Sciweavers

TWC
2010
13 years 1 months ago
Splitting algorithms for fast relay selection: generalizations, analysis, and a unified view
Relay selection for cooperative communications promises significant performance improvements, and is, therefore, attracting, considerable attention. While several criteria have be...
Virag Shah, Neelesh B. Mehta, Raymond Yim
TASE
2010
IEEE
13 years 1 months ago
Sensor Placement for Triangulation-Based Localization
Robots operating in a workspace can localize themselves by querying nodes of a sensor-network deployed in the same workspace. This paper addresses the problem of computing the min...
Onur Tekdas, Volkan Isler
MOR
2006
90views more  MOR 2006»
13 years 6 months ago
Optimal Control and Hedging of Operations in the Presence of Financial Markets
We consider the problem of dynamically hedging the profits of a corporation when these profits are correlated with returns in the financial markets. In particular, we consider the...
René Caldentey, Martin B. Haugh
CORR
2006
Springer
151views Education» more  CORR 2006»
13 years 6 months ago
Combining decision procedures for the reals
Abstract. We address the general problem of determining the validity of boolean combinations of equalities and inequalities between real-valued expressions. In particular, we consi...
Jeremy Avigad, Harvey Friedman
COR
2006
96views more  COR 2006»
13 years 6 months ago
Scheduling two parallel machines with a single server: the general case
This paper considers the problem of scheduling two-operation non-preemptable jobs on two identical semiautomatic machines. A single server is available to carry out the first (or ...
Amir H. Abdekhodaee, Andrew Wirth, Heng-Soon Gan
AAAI
2006
13 years 8 months ago
A Value Theory of Meta-Learning Algorithms
We use game theory to analyze meta-learning algorithms. The objective of meta-learning is to determine which algorithm to apply on a given task. This is an instance of a more gene...
Abraham Bagherjeiran
AAAI
2008
13 years 8 months ago
Interaction Structure and Dimensionality Reduction in Decentralized MDPs
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...
Martin Allen, Marek Petrik, Shlomo Zilberstein
GECCO
2006
Springer
137views Optimization» more  GECCO 2006»
13 years 10 months ago
A unified optimization framework for microelectronics industry
In this paper, an object-oriented unified optimization framework (UOF) for general problem optimization is proposed. Based on evolutionary algorithms, numerical deterministic meth...
Yiming Li, Cheng-Kai Chen, Yen-Yu Cho
PADL
2004
Springer
13 years 12 months ago
USA-Smart: Improving the Quality of Plans in Answer Set Planning
In this paper we show how CR-Prolog, a recent extension of A-Prolog, was used in the successor of USA-Advisor (USA-Smart) in order to improve the quality of the plans returned. The...
Marcello Balduccini
ISPDC
2007
IEEE
14 years 24 days ago
On Grid-based Matrix Partitioning for Heterogeneous Processors
The problem of optimal matrix partitioning for parallel linear algebra on p heterogeneous processors is typically reduced to the geometrical problem of partitioning a unit square ...
Alexey L. Lastovetsky