Sciweavers

1548 search results - page 221 / 310
» Statistical Modelling of CSP Solving Algorithms Performance
Sort
View
GECCO
2006
Springer
157views Optimization» more  GECCO 2006»
14 years 19 days ago
How randomized search heuristics find maximum cliques in planar graphs
Surprisingly, general search heuristics often solve combinatorial problems quite sufficiently, although they do not outperform specialized algorithms. Here, the behavior of simple...
Tobias Storch
AISS
2010
113views more  AISS 2010»
13 years 6 months ago
The Object Replication Method for the Efficient Migration of Agent
The migration method of a mobile agent affects the entire performance of the distributed system. Most of the existing migration methods have the slow-witted structures due to the ...
Yonsik Lee, Kwangwoo Nam
IJACTAICIT
2010
169views more  IJACTAICIT 2010»
13 years 6 months ago
The Migration of Mobile Agent Using the Object Replication
The migration method of a mobile agent affects the entire performance of the distributed system. Most of the existing migration methods have the slow-witted structures due to the ...
Yonsik Lee, Jeongsu Lee
ASMTA
2008
Springer
167views Mathematics» more  ASMTA 2008»
13 years 11 months ago
Perfect Simulation of Stochastic Automata Networks
The solution of continuous and discrete-time Markovian models is still challenging mainly when we model large complex systems, for example, to obtain performance indexes of paralle...
Paulo Fernandes, Jean-Marc Vincent, Thais Webber
SIGMETRICS
2012
ACM
248views Hardware» more  SIGMETRICS 2012»
11 years 11 months ago
Pricing cloud bandwidth reservations under demand uncertainty
In a public cloud, bandwidth is traditionally priced in a pay-asyou-go model. Reflecting the recent trend of augmenting cloud computing with bandwidth guarantees, we consider a n...
Di Niu, Chen Feng, Baochun Li