1477 search results - page 88 / 296 » Random Convex Programs |
AOSD
2007
ACM
14 years 24 days ago
2007
ACM
Inspired by our past manual aspect mining experiences, this paper describes a random walk model to approximate how crosscutting concerns can be discovered in the absence of domain...
ICALP
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. We consider the randomized k-server problem, and give improved results for various metric spaces. In particular, we extend a recent result of Cot
CAEPIA
2003
Springer
14 years 2 months ago
2003
Springer
Abstract. We propose two different methods for generating random orthogonal polygons with a given number of vertices. One is a polynomial time algorithm and it is supported by a t...
ICSE
2007
IEEE-ACM
14 years 9 months ago
2007
IEEE-ACM
Model checkers search the space of possible program behaviors to detect errors and to demonstrate their absence. Despite major advances in reduction and optimization techniques, s...
CPAIOR
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. In constraint programming there are often many choices regarding the propagation method to be used on the constraints of a problem. However, simple constraint solvers usu...