Sciweavers

1332 search results - page 232 / 267
» Combinatorial Algorithms
Sort
View
SAC
2006
ACM
13 years 7 months ago
Challenges in the compilation of a domain specific language for dynamic programming
Many combinatorial optimization problems in biosequence analysis are solved via dynamic programming. To increase programming productivity and program reliability, a domain specifi...
Robert Giegerich, Peter Steffen
TCS
2008
13 years 7 months ago
The Magnus-Derek game
We introduce a new combinatorial game between two players: Magnus and Derek. Initially, a token is placed at position 0 on a round table with n positions. In each round of the gam...
Zhivko Prodanov Nedev, S. Muthukrishnan
GEOINFORMATICA
2002
136views more  GEOINFORMATICA 2002»
13 years 7 months ago
Tabu Search Heuristic for Point-Feature Cartographic Label Placement
The generation of better label placement configurations in maps is a problem that comes up in automated cartographic production. The objective of a good label placement is to displ...
Missae Yamamoto, Gilberto Câmara, Luiz Anton...
ALGORITHMICA
1998
118views more  ALGORITHMICA 1998»
13 years 7 months ago
On the Analysis of Linear Probing Hashing
Abstract. This paper presents moment analyses and characterizations of limit distributions for the construction cost of hash tables under the linear probing strategy. Two models ar...
Philippe Flajolet, Patricio V. Poblete, Alfredo Vi...
DM
1999
145views more  DM 1999»
13 years 7 months ago
Modular decomposition and transitive orientation
A module of an undirected graph is a set X of nodes such for each node x not in X , either every member of X is adjacent to x, or no member of X is adjacent to x. There is a canon...
Ross M. McConnell, Jeremy Spinrad