Sciweavers

6455 search results - page 176 / 1291
» Research problems
Sort
View
ECBS
2003
IEEE
115views Hardware» more  ECBS 2003»
15 years 11 months ago
Details of Formalized Relations in Feature Models Using OCL
System families are a form of high level reuse of development assets in a specific problem domain, by making use of commonalities and variabilities. To represent assets belonging ...
Detlef Streitferdt, Matthias Riebisch, Ilka Philip...
ICDAR
2003
IEEE
15 years 11 months ago
A Neural-Evolutionary Approach for Feature and Architecture Selection in Online Handwriting Recognition
An automatic recognition of online handwritten text has been an on-going research problem for nearly four decades. It has been gaining more interest due to the increasing populari...
Brijesh Verma, Moumita Ghosh
WADS
2001
Springer
143views Algorithms» more  WADS 2001»
15 years 11 months ago
An Approach for Mixed Upward Planarization
In this paper, we consider the problem of finding a mixed upward planarization of a mixed graph, i.e., a graph with directed and undirected edges. The problem is a generalization...
Markus Eiglsperger, Michael Kaufmann
CSC
2009
15 years 7 months ago
An Empirical Analysis of Approximation Algorithms for Euclidean TSP
- The Traveling Salesman Problem (TSP) is perhaps the most famous optimization problem in the set NP-hard. Many problems that are natural applications in computer science and engin...
Bárbara Rodeker, M. Virginia Cifuentes, Lil...
JCSS
2007
88views more  JCSS 2007»
15 years 6 months ago
Counting lattice vectors
We consider the problem of counting the number of lattice vectors of a given length and prove several results regarding its computational complexity. We show that the problem is ...
Denis Xavier Charles