Sciweavers

Share
IPCO
2001
79views Optimization» more  IPCO 2001»
8 years 5 months ago
Synthesis of 2-Commodity Flow Networks
We investigate network design under volatile conditions of link failures and traffic overload. Our model is a non-simultaneous 2-commodity problem. We characterize the feasible so...
Refael Hassin, Asaf Levin
AAAI
2004
8 years 5 months ago
GROWRANGE: Anytime VCG-Based Mechanisms
We introduce anytime mechanisms for distributed optimization with self-interested agents. Anytime mechanisms retain good incentive properties even when interrupted before the opti...
David C. Parkes, Grant Schoenebeck
RSS
2007
119views Robotics» more  RSS 2007»
8 years 5 months ago
Emergent Task Allocation for Mobile Robots
— Multi-robot systems require efficient and accurate planning in order to perform mission-critical tasks. However, algorithms that find the optimal solution are usually computa...
Nuzhet Atay, O. Burçhan Bayazit
DAGSTUHL
2007
8 years 6 months ago
Approximating Solution Structure
Approximations can aim at having close to optimal value or, alternatively, they can aim at structurally resembling an optimal solution. Whereas value-approximation has been extensi...
Iris van Rooij, Matthew Hamilton, Moritz Müll...
COMPGEOM
2005
ACM
8 years 6 months ago
1-link shortest paths in weighted regions
We illustrate the Link Solver software for computing 1-link shortest paths in weighted regions. The Link Solver implements a prune-and-search method that can be used to approximat...
Ovidiu Daescu, James D. Palmer
CRYPTO
2006
Springer
159views Cryptology» more  CRYPTO 2006»
8 years 8 months ago
Asymptotically Optimal Two-Round Perfectly Secure Message Transmission
Abstract. The problem of perfectly secure message transmission concerns two synchronized non-faulty processors sender (S) and receiver (R) that are connected by a synchronous netwo...
Saurabh Agarwal, Ronald Cramer, Robbert de Haan
ATAL
2006
Springer
8 years 8 months ago
Exact solutions of interactive POMDPs using behavioral equivalence
We present a method for transforming the infinite interactive state space of interactive POMDPs (I-POMDPs) into a finite one, thereby enabling the computation of exact solutions. ...
Bharaneedharan Rathnasabapathy, Prashant Doshi, Pi...
KES
1998
Springer
8 years 8 months ago
Properties of robust solution searching in multi-dimensional space with genetic algorithms
-A large number of studies on Genetic Algorithms (GAs) emphasize finding a globally optimal solution. Some other investigations have also been made for detecting multiple solutions...
Shigeyoshi Tsutsui, Lakhmi C. Jain
ICDE
2010
IEEE
184views Database» more  ICDE 2010»
8 years 8 months ago
On optimal anonymization for l+-diversity
-- Publishing person specific data while protecting privacy is an important problem. Existing algorithms that enforce the privacy principle called l-diversity are heuristic based d...
Junqiang Liu, Ke Wang
books