Sciweavers

1996 search results - page 151 / 400
» Financial Theory 2
Sort
View
ECCC
2002
68views more  ECCC 2002»
15 years 4 months ago
Bi-Immunity Separates Strong NP-Completeness Notions
We prove that if for some > 0, NP contains a set that is DTIME(2n )-bi-immune, then NP contains a set that is 2-Turing complete for NP (hence 3-truth-table complete) but not 1-t...
Aduri Pavan, Alan L. Selman
MOR
2000
90views more  MOR 2000»
15 years 4 months ago
A PTAS for Minimizing the Total Weighted Completion Time on Identical Parallel Machines
We consider the problem of scheduling a set of n jobs on m identical parallel machines so as to minimize the weighted sum of job completion times. This problem is NP-hard in the s...
Martin Skutella, Gerhard J. Woeginger
DCG
1999
93views more  DCG 1999»
15 years 4 months ago
New Maximal Numbers of Equilibria in Bimatrix Games
This paper presents a new lower bound of 2:414d= p d on the maximal number of Nash equilibria in d d bimatrix games, a central concept in game theory. The proof uses an equivalent ...
Bernhard von Stengel
TIT
2002
88views more  TIT 2002»
15 years 4 months ago
Duality between channel capacity and rate distortion with two-sided state information
We show that the duality between channel capacity and data compression is retained when state information is available to the sender, to the receiver, to both, or to neither. We pr...
Thomas M. Cover, Mung Chiang
RAS
2007
98views more  RAS 2007»
15 years 4 months ago
Occupancy grids building by sonar and mobile robot
In this paper, a modified method for occupancy grid map building by a moving mobile robot and a scanning ultrasonic range-finder is proposed. The map building process consists o...
Sv. Noykov, Ch. Roumenin