4930 search results - page 799 / 986 » Learning minimal abstractions |
199
Voted
SOCIALCOM
2010
15 years 4 months ago
2010
Abstract--This paper is about how groups solve global coordination problems such as the distributed graph coloring problem. We focused on scenarios in which agents are not able to ...
210
Voted
WAOA
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. We consider the train delivery problem which is a generalization of the bin packing problem and is equivalent to a one dimensional version of the vehicle routing problem ...
202
Voted
CIARP
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. Region-based approaches have been proposed to computerassisted colorization problem, typically using shape similarity and topology relations between regions. Given a colo...
161
click to vote
GD
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. The study of (minimally) rigid graphs is motivated by numerous applications, mostly in robotics and bioinformatics. A major open problem concerns the number of embeddings...
154
Voted
ICC
2009
IEEE
15 years 4 months ago
2009
IEEE
Abstract--Current data network scenario makes Traffic Engineering (TE) a very challenging task. The ever growing access rates and new applications running on end-hosts result in mo...