Sciweavers

170 search results - page 7 / 34
» On the Probability of the Number of Solutions for the P4P Pr...
Sort
View
AIMSA
2004
Springer
14 years 24 days ago
Exploiting the Constrainedness in Constraint Satisfaction Problems
Nowadays, many real problem in Artificial Intelligence can be modeled as constraint satisfaction problems (CSPs). A general rule in constraint satisfaction is to tackle the hardes...
Miguel A. Salido, Federico Barber
GAMESEC
2010
150views Game Theory» more  GAMESEC 2010»
13 years 5 months ago
Adversarial Control in a Delay Tolerant Network
We consider a multi-criteria control problem that arises in a delay tolerant network with two adversarial controllers: the source and the jammer. The source's objective is to ...
Eitan Altman, Tamer Basar, Veeraruna Kavitha
ICASSP
2011
IEEE
12 years 11 months ago
Extended Viterbi algorithm for optimized word HMMS
This paper deals with the problem of finding the optimal sequence of sub-word unit HMMs for a number of given utterances of a word. For this problem we present a new solution bas...
Michael Gerber, Tobias Kaufmann, Beat Pfister
VLSID
2007
IEEE
94views VLSI» more  VLSID 2007»
14 years 7 months ago
A Reduced Complexity Algorithm for Minimizing N-Detect Tests
? We give a new recursive rounding linear programming (LP) solution to the problem of N-detect test minimzation. This is a polynomialtime solution that closely approximates the exa...
Kalyana R. Kantipudi, Vishwani D. Agrawal
MOBIHOC
2001
ACM
14 years 7 months ago
A probabilistic analysis for the range assignment problem in ad hoc networks
In this paper we consider the following problem for ad hoc networks: assume that n nodes are distributed in a d-dimensional region, with 1d3, and assume that all the nodes have th...
Paolo Santi, Douglas M. Blough, Feodor S. Vainstei...