Sciweavers

2157 search results - page 92 / 432
» Binary ant algorithm
Sort
View
106
Voted
SODA
2003
ACM
127views Algorithms» more  SODA 2003»
15 years 1 months ago
Binary space partitions for 3D subdivisions
We consider the following question: Given a subdivision of space into n convex polyhedral cells, what is the worst-case complexity of a binary space partition (BSP) for the subdiv...
John Hershberger, Subhash Suri
4OR
2010
82views more  4OR 2010»
15 years 18 days ago
Diversification-driven tabu search for unconstrained binary quadratic problems
This paper describes a Diversification-Driven Tabu Search (D2 TS) algorithm for solving unconstrained binary quadratic problems. D2 TS is dis
Fred Glover, Zhipeng Lü, Jin-Kao Hao
ALGORITHMICA
2000
161views more  ALGORITHMICA 2000»
15 years 9 days ago
Binary Searching with Nonuniform Costs and Its Application to Text Retrieval
We study the problem of minimizing the expected cost of binary searching for data where the access cost is not fixed and depends on the last accessed element, such as data stored i...
Gonzalo Navarro, Ricardo A. Baeza-Yates, Eduardo F...
ESA
2005
Springer
155views Algorithms» more  ESA 2005»
15 years 6 months ago
A Loopless Gray Code for Minimal Signed-Binary Representations
A string . . . a2a1a0 over the alphabet {−1, 0, 1} is said to be a minimal signed-binary representation of an integer n if n =   k≥0 ak2k and the number of non-zero digits is ...
Gurmeet Singh Manku, Joe Sawada
107
Voted
IPCO
2004
94views Optimization» more  IPCO 2004»
15 years 1 months ago
More on a Binary-Encoded Coloring Formulation
We further develop the 0/1 ILP formulation of Lee for edge coloring where colors are encoded in binary. With respect to that formulation, our main contributions are: (i) an efficie...
Jon Lee, François Margot