277 search results - page 9 / 56 » Israel |
STOC
1998
ACM
13 years 12 months ago
1998
ACM
We present a deterministic strongly polynomial algorithm that computes the permanent of a nonnegative n × n matrix to within a multiplicative factor of en. To this end we develop...
ODR
2008
13 years 9 months ago
2008
The state of ODR in Israel provides an instructive illustration of the developments and achievements in the field as well as the significant challenges that it still faces. The gen...
APPROX
2011
Springer
12 years 7 months ago
2011
Springer
In this work we consider the problem of approximating the number of relevant variables in a function given query access to the function. Since obtaining a multiplicative factor ap...
ICML
2004
IEEE
14 years 8 months ago
2004
IEEE
Abstraction in Reinforcement Learning via Clustering Shie Mannor shie@mit.edu Laboratory for Information and Decision Systems, Massachusetts Institute of Technology, Cambridge, MA ...
ATAL
2009
Springer
14 years 2 months ago
2009
Springer
d Abstract) Dan Erusalimchik1 , Gal A. Kaminka1 , Shai Shlomai2 , Dov Miron1 , and Sarit Kraus2 The 1 MAVERICK Group and the 2 Multi-Agent Systems Group Computer Science Department...