3838 search results - page 128 / 768 » Techniques for Optimization of Net Algorithms |
145
Voted
ESA
1998
Springer
15 years 8 months ago
1998
Springer
In this paper, we study a class of optimal path problems with the following phenomenon: The space complexity of the algorithms for reporting the lengths of single-source optimal pa...
153
Voted
WWW
2006
ACM
16 years 4 months ago
2006
ACM
We introduce a new, powerful class of text proximity queries: find an instance of a given "answer type" (person, place, distance) near "selector" tokens matchi...
102
Voted
CORR
2008
Springer
15 years 3 months ago
2008
Springer
The floating-point implementation of a function often reduces to a polynomial approximation on an interval. Remez algorithm provides the polynomial closest to the function, but th...
180
Voted
CONSTRAINTS
1998
15 years 3 months ago
1998
Many temporal applications like planning and scheduling can be viewed as special cases of the numeric and symbolic temporal constraint satisfaction problem. Thus we have developed ...
137
Voted
ATAL
2004
Springer
15 years 9 months ago
2004
Springer
Distributed Constraint Optimization Problems (DCOP) have, for a long time, been considered an important research area for multi-agent systems because a vast number of realworld si...