Sciweavers

3628 search results - page 89 / 726
» The Decision Diffie-Hellman Problem
Sort
View
JAIR
2011
134views more  JAIR 2011»
13 years 3 months ago
Scaling up Heuristic Planning with Relational Decision Trees
Current evaluation functions for heuristic planning are expensive to compute. In numerous planning problems these functions provide good guidance to the solution, so they are wort...
Tomás de la Rosa, Sergio Jiménez, Ra...
WSNA
2003
ACM
14 years 2 months ago
The coverage problem in a wireless sensor network
One fundamental issue in sensor networks is the coverage problem, which reflects how well a sensor network is monitored or tracked by sensors. In this paper, we formulate this pr...
Chi-Fu Huang, Yu-Chee Tseng
PODC
1999
ACM
14 years 1 months ago
On k-Set Consensus Problems in Asynchronous Systems
ÐIn this paper, we investigate the k-set consensus problem in asynchronous distributed systems. In this problem, each participating process begins the protocol with an input value...
Roberto De Prisco, Dahlia Malkhi, Michael K. Reite...
CVPR
2007
IEEE
14 years 11 months ago
Solving Large Scale Binary Quadratic Problems: Spectral Methods vs. Semidefinite Programming
In this paper we introduce two new methods for solving binary quadratic problems. While spectral relaxation methods have been the workhorse subroutine for a wide variety of comput...
Carl Olsson, Anders P. Eriksson, Fredrik Kahl
FLAIRS
2007
13 years 11 months ago
Pursuing the Best ECOC Dimension for Multiclass Problems
Recent work highlights advantages in decomposing multiclass decision problems into multiple binary problems. Several strategies have been proposed for this decomposition. The most...
Edgar Pimenta, João Gama, André Carl...