Sciweavers

4110 search results - page 181 / 822
» Efficient algorithms for the 2-gathering problem
Sort
View
CODES
2006
IEEE
15 years 10 months ago
Automatic selection of application-specific instruction-set extensions
In this paper, we present a general and an efficient algorithm for automatic selection of new application-specific instructions under hardware resources constraints. The instructi...
Carlo Galuzzi, Elena Moscu Panainte, Yana Yankova,...
ATAL
2008
Springer
15 years 8 months ago
Automatic Generation of Distributed Team Formation Algorithms from Organizational Models
Software systems are subject to ever increasing complexity and in need of efficient structuring. The concept of organization as an exand abstract real-world reference presents a pr...
Michael Köhler-Bußmeier, Matthias Weste...
BDA
2006
15 years 7 months ago
Matching Algorithms for User Notification in Digital Libraries
We consider a publish/subscribe system for digital libraries which continuously evaluates queries over a large repository containing document descriptions. The subscriptions, the ...
Hanen Belhaj Frej, Philippe Rigaux, Nicolas Spyrat...
WAE
2000
103views Algorithms» more  WAE 2000»
15 years 7 months ago
Lattice Basis Reduction with Dynamic Approximation
Abstract. In this paper we present a heuristic based on dynamic approximations for improving the well-known Schnorr-Euchner lattice basis reduction algorithm. In particular, the ne...
Werner Backes, Susanne Wetzel
NIPS
2008
15 years 7 months ago
From Online to Batch Learning with Cutoff-Averaging
We present cutoff averaging, a technique for converting any conservative online learning algorithm into a batch learning algorithm. Most online-to-batch conversion techniques work...
Ofer Dekel