Sciweavers

2233 search results - page 159 / 447
» On the Complexity of Theory Curbing
Sort
View
CORR
1999
Springer
139views Education» more  CORR 1999»
15 years 6 months ago
Combinatorics of branchings in higher dimensional automata
ABSTRACT. We explore the combinatorial properties of the branching areas of execution paths in higher dimensional automata. Mathematically, this means that we investigate the combi...
Philippe Gaucher
SAGT
2010
Springer
202views Game Theory» more  SAGT 2010»
15 years 4 months ago
Computing Stable Outcomes in Hedonic Games
We study the computational complexity of finding stable outcomes in symmetric additively-separable hedonic games. These coalition formation games are specified by an undirected e...
Martin Gairing, Rahul Savani
BICA
2010
15 years 1 months ago
Attention in the ASMO Cognitive Architecture
The ASMO Cognitive Architecture has been developed to support key capabilities: attention, awareness and self-modification. In this paper we describe the underlying attention model...
Rony Novianto, Benjamin Johnston, Mary-Anne Willia...
POPL
2011
ACM
14 years 9 months ago
Decidable logics combining heap structures and data
We define a new logic, STRAND, that allows reasoning with heapmanipulating programs using deductive verification and SMT solvers. STRAND logic (“STRucture ANd Data” logic) f...
P. Madhusudan, Gennaro Parlato, Xiaokang Qiu
SIGECOM
2011
ACM
320views ECommerce» more  SIGECOM 2011»
14 years 9 months ago
Market making and mean reversion
Market making refers broadly to trading strategies that seek to profit by providing liquidity to other traders, while avoiding accumulating a large net position in a stock. In th...
Tanmoy Chakraborty, Michael Kearns