844 search results - page 39 / 169 » Solving the p |
140
click to vote
FLAIRS
2009
15 years 3 months ago
2009
In our experiments with four well-known systems for solving partially observable planning problems (Contingent-FF, MBP, PKS, and POND), we were greatly surprised to find that they...
123
click to vote
PAIRING
2007
Springer
15 years 11 months ago
2007
Springer
Let C be a curve of genus g, defined over a finite field Fq, where q = pm for a prime p. Let N be a large integer coprime to p, dividing the order of the Jacobian variety associ...
152
click to vote
FTDCS
2004
IEEE
15 years 9 months ago
2004
IEEE
Peer-to-peer (P2P) networks and mobile ad hoc networks (MANET) share some key characteristics: selforganization and decentralization, and both need to solve the same fundamental p...
133
click to vote
COCOON
2006
Springer
15 years 9 months ago
2006
Springer
We consider the problem of placing a set of disks in a region containing obstacles such that no two disks intersect. We are given a bounding polygon P and a set R of possibly inte...
142
Voted
ICPP
2007
IEEE
15 years 11 months ago
2007
IEEE
Sequence alignment is a fundamental problem in the computational biology. Many alignment methods have been proposed in the literature, such as pair-wise sequence alignment (2SA), ...