Sciweavers

1160 search results - page 24 / 232
» Applying Constraint Solving to the Management of Distributed...
Sort
View
NETWORKS
2008
15 years 5 months ago
Reformulation and sampling to solve a stochastic network interdiction problem
The Network Interdiction Problem involves interrupting an adversary's ability to maximize flow through a capacitated network by destroying portions of the network. A budget c...
Udom Janjarassuk, Jeff Linderoth
156
Voted
AOSE
2006
Springer
15 years 9 months ago
Applying the Governance Framework Technique to Promote Maintainability in Open Multi-Agent Systems
Abstract. Governance means that specifications are enforced dynamically at application runtime. Governance framework is a technique to design and implement an extensible interactio...
Gustavo R. de Carvalho, Carlos José Pereira...
143
Voted
ICAC
2005
IEEE
15 years 11 months ago
Architecture-Based Autonomous Repair Management: Application to J2EE Clusters
This paper presents a component-based architecture for autonomous repair management in distributed systems, and a prototype implementation of this architecture, called JADE, which...
Sara Bouchenak, Fabienne Boyer, Daniel Hagimont, S...
COMPUTE
2010
ACM
15 years 9 months ago
Mining periodic-frequent patterns with maximum items' support constraints
The single minimum support (minsup) based frequent pattern mining approaches like Apriori and FP-growth suffer from“rare item problem”while extracting frequent patterns. That...
R. Uday Kiran, P. Krishna Reddy
GECCO
2005
Springer
139views Optimization» more  GECCO 2005»
15 years 11 months ago
Solving large scale combinatorial optimization using PMA-SLS
Memetic algorithms have become to gain increasingly important for solving large scale combinatorial optimization problems. Typically, the extent of the application of local search...
Jing Tang, Meng-Hiot Lim, Yew-Soon Ong, Meng Joo E...