Sciweavers

1688 search results - page 214 / 338
» The Complexity of Rationalizing Matchings
Sort
View
TSP
2008
124views more  TSP 2008»
14 years 11 months ago
Dictionary Preconditioning for Greedy Algorithms
This article introduces the concept of sensing dictionaries. It presents an alteration of greedy algorithms like thresholding or (Orthogonal) Matching Pursuit which improves their...
Karin Schnass, Pierre Vandergheynst
CAL
2002
14 years 11 months ago
Worst-case Traffic for Oblivious Routing Functions
This paper presents an algorithm to find a worst-case traffic pattern for any oblivious routing algorithm on an arbitrary interconnection network topology. The linearity of channe...
Brian Towles, William J. Dally
CL
2000
Springer
14 years 11 months ago
Associative definition of programming languages
Associative Language Descriptions are a recent grammar model, theoretically less powerful than Context Free grammars, but adequate for describing the syntax of programming languag...
Stefano Crespi-Reghizzi, Matteo Pradella, Pierluig...
CISIS
2010
IEEE
14 years 9 months ago
Scalable Grid Resource Trading with Greedy Heuristics
As Grid infrastructures become more widely used by the academic and commercial world, the problem of resource allocation increases in complexity. Resource trading markets are one m...
Georg Buss, Kevin Lee, Daniel Veit
PAAMS
2010
Springer
14 years 9 months ago
A Case Study on Grammatical-Based Representation for Regular Expression Evolution
Abstract. Regular expressions, or simply regex, have been widely used as a powerful pattern matching and text extractor tool through decades. Although they provide a powerful and f...
Antonio González-Pardo, David F. Barrero, D...