Sciweavers

4378 search results - page 359 / 876
» On the Complexity of Ordered Colourings
Sort
View
COLING
1994
15 years 9 months ago
Parsing Turkish Using The Lexical Functional Grammar Formalism
This paper describes our work on parsing Turkish using the lexical-functional grammar formalism. This work represents the rst e ort for parsing Turkish. Our implementation is based...
Zelal Güngördü, Kemal Oflazer
210
Voted
GECCO
2008
Springer
179views Optimization» more  GECCO 2008»
15 years 8 months ago
ASAGA: an adaptive surrogate-assisted genetic algorithm
Genetic algorithms (GAs) used in complex optimization domains usually need to perform a large number of fitness function evaluations in order to get near-optimal solutions. In rea...
Liang Shi, Khaled Rasheed
IWCMC
2010
ACM
15 years 8 months ago
Policy-driven workflows for mobile network management automation
Future wireless networks will experience a continuous growth regarding the number of network elements with increasingly complex interrelations between the configuration of multipl...
Raphael Romeikat, Bernhard Bauer, Tobias Bandh, Ge...
209
Voted
PODC
2010
ACM
15 years 8 months ago
The k-bakery: local-spin k-exclusion using non-atomic reads and writes
Mutual exclusion is used to coordinate access to shared resources by concurrent processes. k-Exclusion is a variant of mutual exclusion in which up to k processes can simultaneous...
Robert Danek
ICASSP
2010
IEEE
15 years 7 months ago
Gradient Polytope Faces Pursuit for large scale sparse recovery problems
Polytope Faces Pursuit is a greedy algorithm that performs Basis Pursuit with similar order complexity to Orthogonal Matching Pursuit. The algorithm adds one basis vector at a tim...
Aris Gretsistas, Ivan Damnjanovic, Mark D. Plumble...