Sciweavers

10848 search results - page 2122 / 2170
» Programming in Biomolecular Computation
Sort
View
COLT
1999
Springer
15 years 2 months ago
Regret Bounds for Prediction Problems
We present a unified framework for reasoning about worst-case regret bounds for learning algorithms. This framework is based on the theory of duality of convex functions. It brin...
Geoffrey J. Gordon
RTAS
1999
IEEE
15 years 1 months ago
On Quality of Service Optimization with Discrete QoS Options
We present a QoS management framework that enables us to quantitatively measure QoS, and to analytically plan and allocate resources. In this model, end users' quality prefer...
Chen Lee, John P. Lehoczky, Ragunathan Rajkumar, D...
DATE
1998
IEEE
153views Hardware» more  DATE 1998»
15 years 1 months ago
An Energy-Conscious Exploration Methodology for Reconfigurable DSPs
As the "system-on-a-chip" concept is rapidly becoming a reality, time-to-market and product complexity push the reuse of complex macromodules. Circuits combining a varie...
Jan M. Rabaey, Marlene Wan
KDD
1999
ACM
184views Data Mining» more  KDD 1999»
15 years 1 months ago
Mining Optimized Gain Rules for Numeric Attributes
—Association rules are useful for determining correlations between attributes of a relation and have applications in the marketing, financial, and retail sectors. Furthermore, op...
Sergey Brin, Rajeev Rastogi, Kyuseok Shim
KES
1999
Springer
15 years 1 months ago
Dynamic Demes parallel genetic algorithm
Abstract—Dynamic Demes is a new method for the parallelisation of evolutionary algorithms. It was derived as a combination of two other parallelisation algorithms: the master-sla...
Mariusz Nowostawski, Riccardo Poli
« Prev « First page 2122 / 2170 Last » Next »