Sciweavers

1022 search results - page 23 / 205
» Stable models and circumscription
Sort
View
AAAI
2004
13 years 9 months ago
On Odd and Even Cycles in Normal Logic Programs
An odd cycle of a logic program is a simple cycle that has an odd number of negative edges in the dependency graph of the program. Similarly, an even cycle is one that has an even...
Fangzhen Lin, Xishun Zhao
MANSCI
2008
96views more  MANSCI 2008»
13 years 7 months ago
Staffing of Time-Varying Queues to Achieve Time-Stable Performance
Continuing research by Jennings, Mandelbaum, Massey and Whitt (1996), we investigate methods to perform time-dependent staffing for many-server queues. Our aim is to achieve time-...
Zohar Feldman, Avishai Mandelbaum, William A. Mass...
SIMPAR
2010
127views Robotics» more  SIMPAR 2010»
13 years 6 months ago
On the Stability of Bipedal Walking
Stability of bipedal locomotion is analyzed using a model of a planar biped written in the framework of systems with unilateral constraints. Based on this model, two different sta...
Pieter van Zutven, Dragan Kostic, Henk Nijmeijer
SODA
2008
ACM
88views Algorithms» more  SODA 2008»
13 years 9 months ago
Sampling stable marriages: why spouse-swapping won't work
We study the behavior of random walks along the edges of the stable marriage lattice for various restricted families of allowable preference sets. In the "k-attribute model,&...
Nayantara Bhatnagar, Sam Greenberg, Dana Randall
LPNMR
2001
Springer
14 years 3 days ago
On the Expressibility of Stable Logic Programming
Schlipf (Sch95) proved that Stable Logic Programming (SLP) solves all NP decision problems. We extend Schlipf’s result to prove that SLP solves all search problems in the class ...
V. Wiktor Marek, Jeffrey B. Remmel