Sciweavers

2398 search results - page 291 / 480
» Constraint Programming and Graph Algorithms
Sort
View
PLDI
2004
ACM
15 years 11 months ago
Parametric regular path queries
Regular path queries are a way of declaratively expressing queries on graphs as regular-expression-like patterns that are matched against paths in the graph. There are two kinds o...
Yanhong A. Liu, Tom Rothamel, Fuxiang Yu, Scott D....
AOSD
2007
ACM
15 years 10 months ago
Efficiently mining crosscutting concerns through random walks
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...
Charles Zhang, Hans-Arno Jacobsen
POPL
2002
ACM
16 years 6 months ago
Role analysis
We present a new role system in which the type (or role) of each object depends on its referencing relationships with other objects, with the role changing as these relationships ...
Viktor Kuncak, Patrick Lam, Martin C. Rinard
CPAIOR
2007
Springer
16 years 15 days ago
Hybrid Local Search for Constrained Financial Portfolio Selection Problems
Portfolio selection is a relevant problem arising in finance and economics. While its basic formulations can be efficiently solved through linear or quadratic programming, its mor...
Luca Di Gaspero, Giacomo di Tollo, Andrea Roli, An...
169
Voted
LISP
2008
154views more  LISP 2008»
15 years 6 months ago
Types and trace effects for object orientation
Trace effects are statically generated program abstractions, that can be model checked for verification of assertions in a temporal program logic. In this paper we develop a type a...
Christian Skalka