Sciweavers

7167 search results - page 704 / 1434
» Answer Set Programming
Sort
View
PLDI
2012
ACM
13 years 9 months ago
Dynamic synthesis for relaxed memory models
Modern architectures implement relaxed memory models which may reorder memory operations or execute them non-atomically. Special instructions called memory fences are provided, al...
Feng Liu, Nayden Nedev, Nedyalko Prisadnikov, Mart...
ICSM
2009
IEEE
16 years 1 months ago
Understanding source package organization using the hybrid model
Within a large, object-oriented software system it is common to partition the classes into a set of packages, which implicitly serve as a set of coarsely-grained logical design un...
Xinyi Dong, Michael W. Godfrey
ICALP
2001
Springer
15 years 11 months ago
Approximation Algorithms for Partial Covering Problems
We study the generalization of covering problems to partial covering. Here we wish to cover only a desired number of elements, rather than covering all elements as in standard cov...
Rajiv Gandhi, Samir Khuller, Aravind Srinivasan
STOC
1998
ACM
125views Algorithms» more  STOC 1998»
15 years 11 months ago
Spot-Checkers
On Labor Day weekend, the highway patrol sets up spot-checks at random points on the freeways with the intention of deterring a large fraction of motorists from driving incorrectl...
Funda Ergün, Sampath Kannan, Ravi Kumar, Roni...
CDC
2010
IEEE
122views Control Systems» more  CDC 2010»
15 years 2 months ago
Closed-loop optimal experiment design: The partial correlation approach
Abstract-- We consider optimal experiment design for parametric prediction error system identification of linear timeinvariant systems in closed loop. The optimisation is performed...
Roland Hildebrand, Michel Gevers, Gabriel Solari