Sciweavers

355 search results - page 32 / 71
» An Algorithmic Solution of a Birkhoff Type Problem
Sort
View
ATAL
2008
Springer
13 years 10 months ago
Playing games for security: an efficient exact algorithm for solving Bayesian Stackelberg games
In a class of games known as Stackelberg games, one agent (the leader) must commit to a strategy that can be observed by the other agent (the follower or adversary) before the adv...
Praveen Paruchuri, Jonathan P. Pearce, Janusz Mare...
PERCOM
2007
ACM
14 years 8 months ago
Static Path Planning for Mobile Beacons to Localize Sensor Networks
In this paper, we study the static path planning problem with wireless sensor network localization as the primary objective. We consider a model in which sensors are assumed to be...
Rui Huang, Gergely V. Záruba
SIGMOD
2005
ACM
87views Database» more  SIGMOD 2005»
14 years 8 months ago
When Can We Trust Progress Estimators for SQL Queries?
The problem of estimating progress for long-running queries has recently been introduced. We analyze the characteristics of the progress estimation problem, from the perspective o...
Surajit Chaudhuri, Raghav Kaushik, Ravishankar Ram...
ANSS
1998
IEEE
14 years 23 days ago
On Interval Weighted Three-Layer Neural Networks
In solving application problems, the data sets used to train a neural network may not be hundred percent precise but within certain ranges. Representing data sets with intervals, ...
Mohsen Beheshti, Ali Berrached, André de Ko...
CSDA
2010
132views more  CSDA 2010»
13 years 8 months ago
Approximate low-rank factorization with structured factors
An approximate rank revealing factorization problem with structure constraints on the normalized factors is considered. Examples of structure, motivated by an application in micro...
Ivan Markovsky, Mahesan Niranjan