1984 search results - page 31 / 397 » The colourful feasibility problem |
KIVS
2011
Springer
13 years 23 days ago
2011
Springer
Localized geographic single path routing along a wireless network graph requires exact location information about the network nodes to assure message delivery guarantees. Node loc...
AUSAI
2009
Springer
14 years 1 months ago
2009
Springer
Regressions has successfully been incorporated into memetic algorithm (MA) to build surrogate models for the objective or constraint landscape of optimization problems. This helps ...
ENDM
2010
13 years 7 months ago
2010
The Eulerian closed walk problem in a digraph is a well-known polynomial-time solvable problem. In this paper, we show that if we impose the feasible solutions to fulfill some pre...
DATE
2005
IEEE
14 years 3 months ago
2005
IEEE
In this paper, we present a two-level modeling approach to performance macromodeling based on radial basis function Support Vector Machine (SVM). The two-level model consists of a...
IJMC
2006
13 years 10 months ago
2006
: The Channel Assignment Problem is an NP-complete problem to assign a minimum number of channels under certain constraints to requested calls in a cellular radio system. Examples ...