285 search results - page 41 / 57 » New Ways to Construct Binary Search Trees |
112
click to vote
IPPS
2007
IEEE
15 years 6 months ago
2007
IEEE
Solving optimally large instances of combinatorial optimization problems requires a huge amount of computational resources. In this paper, we propose an adaptation of the parallel...
102
click to vote
MFCS
2000
Springer
15 years 3 months ago
2000
Springer
Abstract. We show how duality properties and geometric considerations are used in studies related to virtual path layouts of ATM networks. We concentrate on the one-to-many problem...
CPAIOR
2010
Springer
15 years 4 months ago
2010
Springer
We introduce an approach which combines ACO (Ant Colony Optimization) and IBM ILOG CP Optimizer for solving COPs (Combinatorial Optimization Problems). The problem is modeled using...
DIS
2007
Springer
15 years 1 months ago
2007
Springer
In this paper, we propose a new concept, thinning-out, for reducing the number of trials in skill discovery. Thinning-out means to skip over such trials that are unlikely to improv...
116
click to vote
CMS
2006
15 years 1 months ago
2006
Abstract. The perspective directions in evaluating network security are simulating possible malefactor's actions, building the representation of these actions as attack graphs...