1209 search results - page 99 / 242 » Approximation by pseudo-linear operators |
150
click to vote
KDD
1997
ACM
15 years 8 months ago
1997
ACM
In this paper 1 we present a method for discovering approximately common motifs (also known as active motifs) in three dimensional (3D) molecules. Each node in a molecule is repre...
163
click to vote
ESA
1993
Springer
15 years 8 months ago
1993
Springer
The problem of maintaining an approximate solution for one-dimensional bin packing when items may arrive and depart dynamically is studied. In accordance with various work on fully...
143
click to vote
ALGOSENSORS
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. We consider the self-deployment problem in a ring for a network of identical sensors: starting from some initial random placement in the ring, the sensors in the network ...
153
click to vote
AIPS
2008
15 years 6 months ago
2008
Many current heuristics for domain-independent planning, such as Bonet and Geffner's additive heuristic and Hoffmann and Nebel's FF heuristic, are based on delete relaxa...
129
click to vote
CASES
2005
ACM
15 years 6 months ago
2005
ACM
Due to resource and power constraints, embedded processors often cannot afford dedicated floating-point units. For instance, the IBM PowerPC processor embedded in Xilinx Virtex-...