Sciweavers

1242 search results - page 195 / 249
» The Theory of Grammar Constraints
Sort
View
APPROX
2009
Springer
142views Algorithms» more  APPROX 2009»
14 years 5 months ago
Truthful Mechanisms via Greedy Iterative Packing
An important research thread in algorithmic game theory studies the design of efficient truthful mechanisms that approximate the optimal social welfare. A fundamental question is ...
Chandra Chekuri, Iftah Gamzu
ATAL
2009
Springer
14 years 5 months ago
Multiagent commitment alignment
Commitments provide a basis for understanding interactions in multiagent systems. Successful interoperation relies upon the interacting parties being aligned with respect to their...
Amit K. Chopra, Munindar P. Singh
FOSAD
2009
Springer
14 years 5 months ago
The Open-Source Fixed-Point Model Checker for Symbolic Analysis of Security Protocols
We introduce the Open-source Fixed-point Model Checker OFMC for symbolic security protocol analysis, which extends the Onthe-fly Model Checker (the previous OFMC). The native inpu...
Sebastian Mödersheim, Luca Viganò
BIBM
2008
IEEE
159views Bioinformatics» more  BIBM 2008»
14 years 5 months ago
Probe Design for Compressive Sensing DNA Microarrays
Abstract—Compressive Sensing Microarrays (CSM) are DNAbased sensors that operate using group testing and compressive sensing (CS) principles. In contrast to conventional DNA micr...
Wei Dai, Olgica Milenkovic, Mona A. Sheikh, Richar...
CCGRID
2008
IEEE
14 years 5 months ago
A Stochastic Programming Approach for QoS-Aware Service Composition
—We formulate the service composition problem as a multi-objective stochastic program which simultaneously optimizes the following quality of service (QoS) parameters: workflow ...
Wolfram Wiesemann, Ronald Hochreiter, Daniel Kuhn