Sciweavers

962 search results - page 47 / 193
» Near-optimal solutions for the generalized max-controlled se...
Sort
View
FOSSACS
2009
Springer
15 years 4 months ago
Facets of Synthesis: Revisiting Church's Problem
In this essay we discuss the origin, central results, and some perspectives of algorithmic synthesis of nonterminating reactive programs. We recall the fundamental questions raised...
Wolfgang Thomas
CVPR
2005
IEEE
15 years 12 months ago
Graph Embedding: A General Framework for Dimensionality Reduction
In the last decades, a large family of algorithms supervised or unsupervised; stemming from statistic or geometry theory have been proposed to provide different solutions to the p...
Shuicheng Yan, Dong Xu, Benyu Zhang, HongJiang Zha...
KDD
2007
ACM
249views Data Mining» more  KDD 2007»
15 years 10 months ago
The minimum consistent subset cover problem and its applications in data mining
In this paper, we introduce and study the Minimum Consistent Subset Cover (MCSC) problem. Given a finite ground set X and a constraint t, find the minimum number of consistent sub...
Byron J. Gao, Martin Ester, Jin-yi Cai, Oliver Sch...
HICSS
2003
IEEE
123views Biometrics» more  HICSS 2003»
15 years 3 months ago
Issues in Rational Planning in Multi-Agent Settings
We adopt the decision-theoretic principle of expected utility maximization as a paradigm for designing autonomous rational agents operating in multi-agent environments. We use the...
Piotr J. Gmytrasiewicz
ECRTS
2010
IEEE
14 years 11 months ago
Preemption Points Placement for Sporadic Task Sets
Abstract--Limited preemption scheduling has been introduced as a viable alternative to non-preemptive and fullypreemptive scheduling when reduced blocking times need to coexist wit...
Marko Bertogna, Giorgio C. Buttazzo, Mauro Marinon...