Sciweavers

2543 search results - page 149 / 509
» Optimal Ordered Problem Solver
Sort
View
98
Voted
ISCAS
2002
IEEE
86views Hardware» more  ISCAS 2002»
15 years 8 months ago
On the optimal labeling for pseudo-chaotic phase hopping
In this paper we introduce the PCPH (Pseudo-Chaotic Phase Hopping) telecommunication scheme, which is obtained by combining pseudo-chaotic encoding with N-ary phase shift keying. ...
Zbigniew Galias, Gian Mario Maggio
ACL
1994
15 years 4 months ago
Optimizing the Computational Lexicalization of Large Grammars
The computational lexicalization of a grammar is the optimization of the links between lexicalized rules and lexical items in order to improve the quality of the bottom-up filteri...
Christian Jacquemin
JAIR
2007
141views more  JAIR 2007»
15 years 3 months ago
Bin Completion Algorithms for Multicontainer Packing, Knapsack, and Covering Problems
Many combinatorial optimization problems such as the bin packing and multiple knapsack problems involve assigning a set of discrete objects to multiple containers. These problems ...
Alex S. Fukunaga, Richard E. Korf
TEC
2002
120views more  TEC 2002»
15 years 2 months ago
Optimization based on bacterial chemotaxis
We present an optimization algorithm based on a model of bacterial chemotaxis. The original biological model is used to formulate a simple optimization algorithm, which is evaluate...
Sibylle D. Müller, Jarno Marchetto, Stefano A...
CIAC
2000
Springer
105views Algorithms» more  CIAC 2000»
15 years 7 months ago
Algorithms for a Simple Point Placement Problem
We consideralgorithms for a simple one-dimensionalpoint placement problem: given N points on a line, and noisy measurements of the distances between many pairs of them, estimate th...
Joshua Redstone, Walter L. Ruzzo