Sciweavers

1816 search results - page 25 / 364
» A New Approach for Solving the Maximum Clique Problem
Sort
View
CSREASAM
2006
15 years 1 months ago
A New Approach For Source Authentication Of Multicast Data
Multicast Security is one of the important problems to solve for the successful deployment of group communication applications, and source authentication of multicast data is a key...
Jinxin He, Gaochao Xu, Zhiguo Zhou, Guannan Gong
AIPS
2008
15 years 2 months ago
Using Constraint Networks on Timelines to Model and Solve Planning and Scheduling Problems
In the last decades, there has been an increasing interest in the connection between planning and constraint programming. Several approaches were used, leading to different forms ...
Cédric Pralet, Gérard Verfaillie
IPPS
2007
IEEE
15 years 6 months ago
A Grid-enabled Branch and Bound Algorithm for Solving Challenging Combinatorial Optimization Problems
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...
Mohand-Said Mezmaz, Nouredine Melab, El-Ghazali Ta...
EVOW
2005
Springer
15 years 5 months ago
Scatter Search Particle Filter to Solve the Dynamic Travelling Salesman Problem
This paper presents the Scatter Search Particle Filter (SSPF) algorithm and its application to the Dynamic Travelling Salesman Problem (DTSP). SSPF combines sequential estimation a...
Juan José Pantrigo, Abraham Duarte, Á...
IPPS
1999
IEEE
15 years 4 months ago
Solving Satisfiability Problems on FPGAs using Experimental Unit Propagation Heuristic
This paperpresents new resultson anapproach for solvingsatisfiability problems (SAT), that is, creating a logic circuit that is specialized to solve each problem instance on Field ...
Takayuki Suyama, Makoto Yokoo, Akira Nagoya