1389 search results - page 168 / 278 » Lightweight dependent classes |
EMSOFT
2010
Springer
13 years 8 months ago
2010
Springer
Correct and efficient implementation of general real-time applications remains by far an open problem. A key issue is meeting timing constraints whose satisfaction depends on feat...
SMC
2010
IEEE
13 years 8 months ago
2010
IEEE
Abstract--Finding the longest simple path in a generic undirected graph is a challenging issue that belongs to the NPComplete class of problems. Four approaches based on genetic al...
IADIS
2009
13 years 7 months ago
2009
Web-based learning environments are extensively used nowadays. These environments maintain and produce vast amounts of data. Such vastness lead to the application of data mining t...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
Constraint Satisfaction Problems (CSP) constitute a convenient way to capture many combinatorial problems. The general CSP is known to be NP-complete, but its complexity depends on...
CDC
2010
IEEE
13 years 5 months ago
2010
IEEE
This paper studies a general class of formations of unicycle robots. One of the robots plays the role of the leader and the formation is induced through a constraint function F tha...