Sciweavers

281 search results - page 12 / 57
» heuristics 2000
Sort
View
INFORMATICALT
2000
113views more  INFORMATICALT 2000»
13 years 9 months ago
An Intensive Search Algorithm for the Quadratic Assignment Problem
Many heuristics, such as simulated annealing, genetic algorithms, greedy randomized adaptive search procedures are stochastic. In this paper, we propose a deterministic heuristic a...
Alfonsas Misevicius
ADBIS
2000
Springer
82views Database» more  ADBIS 2000»
14 years 2 months ago
A New Algorithm for Page Access Sequencing in Join Processing
Abstract. One of the fundamental problems in relational database management is the handling of the join operation. Two of the problems are: 1) finding a page access sequence which...
Andrew Lim, Wee-Chong Oon, Chi-Hung Chi
INFOCOM
2000
IEEE
14 years 2 months ago
Max-Min D-Cluster Formation in Wireless Ad Hoc Networks
— An ad hoc network may be logically represented as a set of clusters. The clusterheads form a -hop dominating set. Each node is at most hops from a clusterhead. Clusterheads for...
Alan D. Amis, Ravi Prakash, Dung Huynh, Thai Vuong
HEURISTICS
2000
90views more  HEURISTICS 2000»
13 years 9 months ago
Tabu Search for a Network Loading Problem with Multiple Facilities
This paper examines a network design problem that arises in the telecommunications industry. In this problem, communication between a gateway vertex and a number of demand vertice...
David Berger, Bernard Gendron, Jean-Yves Potvin, S...
DL
2000
Springer
351views Digital Library» more  DL 2000»
14 years 2 months ago
Acrophile: an automated acronym extractor and server
We implemented a web server for acronym and abbreviation lookup, containing a collection of acronyms and their expansions gathered from a large number of web pages by a heuristic ...
Leah S. Larkey, Paul Ogilvie, M. Andrew Price, Bre...