4342 search results - page 571 / 869 » Improved Algorithms for Optimal Embeddings |
181
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
Computer networks have expanded significantly in use and numbers. This expansion makes them more vulnerable to attack by malicious agents. Many current intrusion detection systems...
170
click to vote
LISP
2008
15 years 6 months ago
2008
For functional programs, unboxing aggregate data structures such as tuples removes memory indirections and frees dead components of the decoupled structures. To explore the consequ...
174
Voted
IJAIT
2007
15 years 6 months ago
2007
In this paper, we study the unrelated parallel machine problem for minimizing the makespan, which is NP-hard. We used Simulated Annealing (SA) and Tabu Search (TS) with Neighborho...
206
click to vote
AROBOTS
2002
15 years 6 months ago
2002
We describe techniques to optimally select landmarks for performing mobile robot localization by matching terrain maps. The method is based upon a maximum-likelihood robot localiza...
144
click to vote
CG
2002
Springer
15 years 6 months ago
2002
Springer
Abstract. Post's correspondence problem (PCP) is a classic undecidable problem. Its theoretical unbounded search space makes it hard to judge whether a PCP instance has a solu...