Sciweavers

1986 search results - page 328 / 398
» constraints 2006
Sort
View
ATAL
2006
Springer
14 years 1 months ago
Learning to identify winning coalitions in the PAC model
We consider PAC learning of simple cooperative games, in which the coalitions are partitioned into "winning" and "losing" coalitions. We analyze the complexity...
Ariel D. Procaccia, Jeffrey S. Rosenschein
ATVA
2006
Springer
131views Hardware» more  ATVA 2006»
14 years 1 months ago
Timed Unfoldings for Networks of Timed Automata
Whereas partial order methods have proved their efficiency for the analysis of discrete-event systems, their application to timed systems remains a challenging research topic. Here...
Patricia Bouyer, Serge Haddad, Pierre-Alain Reynie...
AUSAI
2006
Springer
14 years 1 months ago
Automatic Generation of Funny Cartoons Diary for Everyday Mobile Life
Abstract. The notable developments in pervasive and wireless technology enable us to collect enormous sensor data from each individual. With contextaware technologies, these data c...
Injee Song, Myung-Chul Jung, Sung-Bae Cho
AUSDM
2006
Springer
118views Data Mining» more  AUSDM 2006»
14 years 1 months ago
Efficiently Identifying Exploratory Rules' Significance
How to efficiently discard potentially uninteresting rules in exploratory rule discovery is one of the important research foci in data mining. Many researchers have presented algor...
Shiying Huang, Geoffrey I. Webb
CARDIS
2006
Springer
114views Hardware» more  CARDIS 2006»
14 years 1 months ago
A Low-Footprint Java-to-Native Compilation Scheme Using Formal Methods
Ahead-of-Time and Just-in-Time compilation are common ways to improve runtime performances of restrained systems like Java Card by turning critical Java methods into native code. H...
Alexandre Courbot, Mariela Pavlova, Gilles Grimaud...