Sciweavers

844 search results - page 39 / 169
» Solving the p
Sort
View
FLAIRS
2009
14 years 7 months ago
Maintaining Focus: Overcoming Attention Deficit Disorder in Contingent Planning
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...
Ronald Alford, Ugur Kuter, Dana S. Nau, Elnatan Re...
PAIRING
2007
Springer
15 years 3 months ago
On the Minimal Embedding Field
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...
Laura Hitt
FTDCS
2004
IEEE
15 years 1 months ago
Towards an Integrated Architecture for Peer-to-Peer and Ad Hoc Overlay Network Applications
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...
Lu Yan, Kaisa Sere, Xinrong Zhou, Jun Pang
COCOON
2006
Springer
15 years 1 months ago
A Polynomial-Time Approximation Algorithm for a Geometric Dispersion Problem
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...
Marc Benkert, Joachim Gudmundsson, Christian Knaue...
ICPP
2007
IEEE
15 years 4 months ago
Efficient Parallel Algorithm for Optimal Three-Sequences Alignment
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), ...
Chun-Yuan Lin, Chen Tai Huang, Yeh-Ching Chung, Ch...