9842 search results - page 1283 / 1969 » The Complexity of the Matching-Cut Problem |
182
click to vote
NICSO
2010
Springer
16 years 1 months ago
2010
Springer
We investigate the search properties of pre-evolutionary random catalytic reaction networks, where reactions might be reversible, and replication is not taken for granted. Since it...
192
click to vote
CEC
2008
IEEE
16 years 1 months ago
2008
IEEE
— The problem of robotic area coverage is applicable to many domains, such as search, agriculture, cleaning, and machine tooling. The robotic area coverage task is concerned with...
188
click to vote
ICALT
2008
IEEE
16 years 1 months ago
2008
IEEE
Collaboration has long been considered an effective approach to learning. However, forming optimal groups can be a time consuming and complex task. Different approaches have been ...
188
click to vote
ICPR
2008
IEEE
16 years 1 months ago
2008
IEEE
Caption detection in the video is an active research topic in recent years. In the conventional methods, one of most difficult problems is to effectively and quickly extract the ...
238
click to vote
ADC
2008
Springer
16 years 1 months ago
2008
Springer
Existing graph mining algorithms typically assume that the dataset can fit into main memory. As many large graph datasets cannot satisfy this condition, truly scalable graph minin...