12289 search results - page 577 / 2458 » computing 2006 |
189
click to vote
HEURISTICS
2002
15 years 6 months ago
2002
Neighborhood search heuristics like local search and its variants are some of the most popular approaches to solve discrete optimization problems of moderate to large size. Apart ...
194
click to vote
IJAR
2002
15 years 6 months ago
2002
We develop a decision-theoretic method that yields approximate, low cost troubleshooting plans by making more relevant observations and devoting more time to generate a plan. The ...
154
click to vote
IJBC
2002
15 years 6 months ago
2002
We give a method for finding symbolic dynamics for a planar diffeomorphism with a homoclinic tangle. The method only requires a finite piece of tangle, which can be computed with ...
177
Voted
IJCGA
2002
15 years 6 months ago
2002
This paper presents how the space of spheres and shelling may be used to delete a point from a d-dimensional triangulation efficiently. In dimension two, if k is the degree of the...
148
Voted
IJISEC
2002
15 years 6 months ago
2002
Using a random deal of cards to players and a computationally unlimited eavesdropper, all players wish to share a one-bit secret key which is informationtheoretically secure from t...