Sciweavers

1998 search results - page 343 / 400
» Basic Association Rules
Sort
View
LOGCOM
2010
128views more  LOGCOM 2010»
13 years 7 months ago
Answer Set Programming with Resources
In this paper, we propose an extension of Answer Set Programming (ASP) to support declarative reasoning on consumption and production of resources. We call the proposed extension ...
Stefania Costantini, Andrea Formisano
SSS
2010
Springer
118views Control Systems» more  SSS 2010»
13 years 7 months ago
Modeling and Analyzing Periodic Distributed Computations
The earlier work on predicate detection has assumed that the given computation is finite. Detecting violation of a liveness predicate requires that the predicate be evaluated on a...
Anurag Agarwal, Vijay K. Garg, Vinit A. Ogale
TCS
2010
13 years 7 months ago
Active learning in heteroscedastic noise
We consider the problem of actively learning the mean values of distributions associated with a finite number of options. The decision maker can select which option to generate t...
András Antos, Varun Grover, Csaba Szepesv&a...
TON
2010
83views more  TON 2010»
13 years 7 months ago
Understanding and modeling the internet topology: economics and evolution perspective
Abstract—In this paper, we seek to understand the intrinsic reasons for the well-known phenomenon of heavy-tailed degree in the Internet AS graph and argue that in contrast to tr...
Xiaoming Wang, Dmitri Loguinov
AAAI
2010
13 years 6 months ago
Cloning in Elections
We consider the problem of manipulating elections via cloning candidates. In our model, a manipulator can replace each candidate c by one or more clones, i.e., new candidates that...
Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko