1964 search results - page 69 / 393 » Partitioning Based Algorithms for Some Colouring Problems |
CN
2010
13 years 8 months ago
2010
The dynamic point coverage problem in wireless sensor networks is to detect some moving target points in the area of the network using as little sensor nodes as possible. One way ...
ISSAC
1997
Springer
1997
Springer
The Minimised Geometric Buchberger Algorithm: An Optimal Algebraic Algorithm for Integer Programming
13 years 12 months ago
IP problems characterise combinatorial optimisation problems where conventional numerical methods based on the hill-climbing technique can not be directly applied. Conventional me...
GECCO
2004
Springer
14 years 1 months ago
2004
Springer
The use of Genetic Algorithms in evolution of mutants and test cases offers new possibilities in addressing some of the main problems of mutation testing. Most specifically the p...
AIEDAM
1999
13 years 7 months ago
1999
Intelligent agents must update their knowledge base as they acquire new information about their environment. The modal logic S5n has been designed for representing knowledge bases...
WAOA
2005
Springer
14 years 1 months ago
2005
Springer
Given a graph G = (V, E) with n vertices, m edges and maximum vertex degree ∆, the load distribution of a coloring ϕ : V → {red, blue} is a pair dϕ = (rϕ, bϕ), where rϕ i...