COCOA
2009
Springer
14 years 3 months ago
2009
Springer
stract to be announcedPlenary session 09:00-10:00 Panos M, Pardalos, University of Florida, USA Tea Break 10:00-10:20 At the 1st floor 10:20-10:45 Polynomial Approximation Schemes ...
COCOA
2009
Springer
14 years 4 months ago
2009
Springer
Online social network has developed significantly in recent years as a medium of communicating, sharing and disseminating information and spreading influence. Most of current resea...
COCOA
2009
Springer
14 years 4 months ago
2009
Springer
Abstract. This paper proposes a method to compute the transitive closure of a union of affine relations on integer tuples. Within Presburger arithmetics, complete algorithms to com...
COCOA
2009
Springer
14 years 5 months ago
2009
Springer
Discovering groups of genes that share common expression profiles is an important problem in DNA microarray analysis. Unfortunately, standard bi-clustering algorithms often fail t...
COCOA
2009
Springer
14 years 5 months ago
2009
Springer
Abstract. In wireless communication networks, optimal use of the directional antenna is very important. The directional antenna coverage (DAC) problem is to cover all clients with ...
COCOA
2009
Springer
14 years 5 months ago
2009
Springer
: Under water sensor network is an important research direction in computer science. There are many interesting optimization problems regarding its design, routing and applications...
COCOA
2009
Springer
14 years 5 months ago
2009
Springer
Abstract. Pooling design is an important research topic in bioinformatics due to its wide applications in molecular biology, especially DNA library screening. In this paper, with u...
COCOA
2009
Springer
14 years 7 months ago
2009
Springer
This work presents a simple graph based heuristic that employs a roulette wheel selection mechanism for solving examination timetabling problems. We arrange exams in non-increasing...
COCOA
2009
Springer
14 years 7 months ago
2009
Springer
Abstract. The node-weighted Steiner tree problem is a variation of classical Steiner minimum tree problem. Given a graph G = (V, E) with node weight function C : V → R+ and a sub...
COCOA
2009
Springer
14 years 7 months ago
2009
Springer
In the context of scheduling and timetabling, we study a challenging combinatorial problem which is very interesting for both practical and theoretical points of view. The motivati...