Sciweavers

1089 search results - page 211 / 218
» Bounds on generalized Frobenius numbers
Sort
View
ATAL
2008
Springer
13 years 9 months ago
Approximating power indices
Many multiagent domains where cooperation among agents is crucial to achieving a common goal can be modeled as coalitional games. However, in many of these domains, agents are une...
Yoram Bachrach, Evangelos Markakis, Ariel D. Proca...
CPAIOR
2008
Springer
13 years 9 months ago
Connections in Networks: A Hybrid Approach
This paper extends our previous work by exploring the use of a hybrid solution method for solving the connection subgraph problem. We employ a two phase solution method, which dras...
Carla P. Gomes, Willem Jan van Hoeve, Ashish Sabha...
CRYPTO
2008
Springer
98views Cryptology» more  CRYPTO 2008»
13 years 9 months ago
One-Time Programs
Abstract. In this work, we introduce one-time programs, a new computational paradigm geared towards security applications. A one-time program can be executed on a single input, who...
Shafi Goldwasser, Yael Tauman Kalai, Guy N. Rothbl...
EKAW
2008
Springer
13 years 9 months ago
Learning Disjointness for Debugging Mappings between Lightweight Ontologies
Abstract. Dealing with heterogeneous ontologies by means of semantic mappings has become an important area of research and a number of systems for discovering mappings between onto...
Christian Meilicke, Johanna Völker, Heiner St...
APPROX
2010
Springer
193views Algorithms» more  APPROX 2010»
13 years 9 months ago
Approximation Algorithms for the Directed k-Tour and k-Stroll Problems
We consider two natural generalizations of the Asymmetric Traveling Salesman problem: the k-Stroll and the k-Tour problems. The input to the k-Stroll problem is a directed n-verte...
MohammadHossein Bateni, Julia Chuzhoy