Sciweavers

455 search results - page 50 / 91
» Dynamic well-spaced point sets
Sort
View
CDC
2010
IEEE
112views Control Systems» more  CDC 2010»
14 years 4 months ago
Online Convex Programming and regularization in adaptive control
Online Convex Programming (OCP) is a recently developed model of sequential decision-making in the presence of time-varying uncertainty. In this framework, a decisionmaker selects ...
Maxim Raginsky, Alexander Rakhlin, Serdar Yük...
INFOCOM
2012
IEEE
13 years 8 days ago
ICP: Design and evaluation of an Interest control protocol for content-centric networking
—Content-centric networking (CCN) brings a paradigm shift in the present Internet communication model by addressing named-data instead of host locations. With respect to TCP/IP, ...
Giovanna Carofiglio, Massimo Gallo, Luca Muscariel...
ICPR
2000
IEEE
15 years 11 months ago
Measuring the Complexity of Classification Problems
We studied a number of measures that characterize the difficulty of a classification problem. We compared a set of real world problems to random combinations of points in this mea...
Tin Kam Ho, Mitra Basu
CDC
2009
IEEE
131views Control Systems» more  CDC 2009»
15 years 2 months ago
An algebraic approach for the NCE principle with massive subpopulations
— We study large population stochastic dynamic games where each agent receives influences from multi-classes of agents according to intra- and inter-subpopulation cost coupling....
Minyi Huang
ASAP
2004
IEEE
185views Hardware» more  ASAP 2004»
15 years 1 months ago
Families of FPGA-Based Algorithms for Approximate String Matching
Dynamic programming for approximate string matching is a large family of different algorithms, which vary significantly in purpose, complexity, and hardware utilization. Many impl...
Tom Van Court, Martin C. Herbordt