1984 search results - page 17 / 397 » The colourful feasibility problem |
ICPR
2006
IEEE
14 years 11 months ago
2006
IEEE
Textural appearance of many real word materials is not static but shows progress in time. If such a progress is spatially and temporally homogeneous these materials can be represe...
DICTA
2007
13 years 11 months ago
2007
This paper presents an appearance–based method to automatically determine places from vision data for topological mapping. The approach exploits the continuity of the visual app...
ATAL
2010
Springer
13 years 11 months ago
2010
Springer
In large wireless sensor networks, the problem of assigning radio frequencies to sensing agents such that no two connected sensors are assigned the same value (and will thus inter...
JSAT
2008
13 years 9 months ago
2008
The local search algorithm GSAT is based on the notion of Satisfiability. It has been used successfully for colouring graphs, solving instances of the 3SAT problem, planning block...
ICST
2009
IEEE
14 years 4 months ago
2009
IEEE
The problem of testing from an extended finite state machine (EFSM) can be expressed in terms of finding suitable paths through the EFSM and then deriving test data to follow the ...