Sciweavers

1550 search results - page 160 / 310
» Optimizing search by showing results in context
Sort
View
CPM
2008
Springer
148views Combinatorics» more  CPM 2008»
15 years 8 months ago
On-Line Approximate String Matching with Bounded Errors
We introduce a new dimension to the widely studied on-line approximate string matching problem, by introducing an error threshold parameter so that the algorithm is allowed to mis...
Marcos A. Kiwi, Gonzalo Navarro, Claudio Telha
DILS
2006
Springer
15 years 10 months ago
A Method for Similarity-Based Grouping of Biological Data
Similarity-based grouping of data entries in one or more data sources is a task underlying many different data management tasks, such as, structuring search results, removal of red...
Vaida Jakoniene, David Rundqvist, Patrick Lambrix
IPPS
2006
IEEE
16 years 15 days ago
Compiler assisted dynamic management of registers for network processors
Modern network processors support high levels of parallelism in packet processing by supporting multiple threads that execute on a micro-engine. Threads switch context upon encoun...
R. Collins, Fernando Alegre, Xiaotong Zhuang, Sant...
GECCO
2009
Springer
151views Optimization» more  GECCO 2009»
16 years 1 months ago
Swarming to rank for information retrieval
This paper presents an approach to automatically optimize the retrieval quality of ranking functions. Taking a Swarm Intelligence perspective, we present a novel method, SwarmRank...
Ernesto Diaz-Aviles, Wolfgang Nejdl, Lars Schmidt-...
AAAI
2007
15 years 8 months ago
Understanding Performance Tradeoffs in Algorithms for Solving Oversubscribed Scheduling
In recent years, planning and scheduling research has paid increasing attention to problems that involve resource oversubscription, where cumulative demand for resources outstrips...
Laurence A. Kramer, Laura Barbulescu, Stephen F. S...