Sciweavers

3678 search results - page 524 / 736
» On the Stable Paths Problem
Sort
View
SIGECOM
2003
ACM
124views ECommerce» more  SIGECOM 2003»
15 years 9 months ago
Coalitional games on graphs: core structure, substitutes and frugality
We study mechanisms that can be modelled as coalitional games with transferable utilities, and apply ideas from mechanism design and game theory to problems arising in a network d...
Rahul Garg, Vijay Kumar, Atri Rudra, Akshat Verma
CSL
2003
Springer
15 years 9 months ago
Simple Stochastic Parity Games
Many verification, planning, and control problems can be modeled as games played on state-transition graphs by one or two players whose conflicting goals are to form a path in th...
Krishnendu Chatterjee, Marcin Jurdzinski, Thomas A...
EMMCVPR
2003
Springer
15 years 9 months ago
Curve Matching Using the Fast Marching Method
Common techniques for curve alignment find a solution in the form of a shortest network path by means of dynamic programming. In this paper we present an approach that employs Set...
Max Frenkel, Ronen Basri
GECCO
2003
Springer
130views Optimization» more  GECCO 2003»
15 years 9 months ago
Extracting Test Sequences from a Markov Software Usage Model by ACO
The aim of the paper is to investigate methods for deriving a suitable set of test paths for a software system. The design and the possible uses of the software system are modelled...
Karl Doerner, Walter J. Gutjahr
DATE
2010
IEEE
136views Hardware» more  DATE 2010»
15 years 9 months ago
Reversible logic synthesis through ant colony optimization
Abstract—We propose a novel synthesis technique for reversible logic based on ant colony optimization (ACO). In our ACO-based approach, reversible logic synthesis is formulated a...
Min Li, Yexin Zheng, Michael S. Hsiao, Chao Huang