Sciweavers

3190 search results - page 489 / 638
» cans 2011
Sort
View
AAAI
2012
13 years 8 months ago
On Maxsum Fair Cake Divisions
We consider the problem of selecting fair divisions of a heterogeneous divisible good among a set of agents. Recent work (Cohler et al., AAAI 2011) focused on designing algorithms...
Steven J. Brams, Michal Feldman, John K. Lai, Jami...
AI
2011
Springer
15 years 1 months ago
Approximation of action theories and its application to conformant planning
This paper describes our methodology for building conformant planners, which is based on recent advances in the theory of action and change and answer set programming. The develop...
Phan Huy Tu, Tran Cao Son, Michael Gelfond, A. Ric...
BMCBI
2011
15 years 1 months ago
iPhy: an integrated phylogenetic workbench for supermatrix analyses
Background: The increasing availability of molecular sequence data means that the accuracy of future phylogenetic studies is likely to by limited by systematic bias and taxon choi...
Martin O. Jones, Georgios D. Koutsovoulos, Mark L....
TIFS
2011
252views Education» more  TIFS 2011»
15 years 1 months ago
Secure Device Pairing Based on a Visual Channel: Design and Usability Study
— “Pairing” is the establishment of authenticated key agreement between two devices over a wireless channel. Such devices are ad hoc in nature as they lack any common preshar...
Nitesh Saxena, Jan-Erik Ekberg, Kari Kostiainen, N...
INFOCOM
2011
IEEE
14 years 10 months ago
Space-time tradeoff in regular expression matching with semi-deterministic finite automata
Abstract—Regular expression matching (REM) with nondeterministic finite automata (NFA) can be computationally expensive when a large number of patterns are matched concurrently....
Yi-Hua E. Yang, Viktor K. Prasanna