Sciweavers

3096 search results - page 355 / 620
» The Generalized FITC Approximation
Sort
View
SIGCSE
2005
ACM
122views Education» more  SIGCSE 2005»
16 years 3 days ago
Design process for a non-majors computing course
There is growing interest in computing courses for non-CS majors. We have recently built such a course that has met with positive response. We describe our design process, which i...
Mark Guzdial, Andrea Forte
AAIM
2005
Springer
122views Algorithms» more  AAIM 2005»
16 years 2 days ago
Complexity of Minimal Tree Routing and Coloring
Let G be a undirected connected graph. Given a set of g groups each being a subset of V (G), tree routing and coloring is to produce g trees in G and assign a color to each of them...
Xujin Chen, Xiao-Dong Hu, Xiaohua Jia
CPAIOR
2005
Springer
16 years 2 days ago
Filtering Algorithms for the NValue Constraint
Abstract. The NValue constraint counts the number of different values assigned to a vector of variables. Propagating generalized arc consistency on this constraint is NP-hard. We ...
Christian Bessière, Emmanuel Hebrard, Brahi...
DGCI
2005
Springer
16 years 2 days ago
The Class of Simple Cube-Curves Whose MLPs Cannot Have Vertices at Grid Points
We consider simple cube-curves in the orthogonal 3D grid of cells. The union of all cells contained in such a curve (also called the tube of this curve) is a polyhedrally bounded s...
Fajie Li, Reinhard Klette
GECCO
2005
Springer
175views Optimization» more  GECCO 2005»
16 years 2 days ago
Nonlinear feature extraction using a neuro genetic hybrid
Feature extraction is a process that extracts salient features from observed variables. It is considered a promising alternative to overcome the problems of weight and structure o...
Yung-Keun Kwon, Byung Ro Moon