5889 search results - page 1072 / 1178 » Graph Layout Problems |
GECCO
2005
Springer
15 years 3 months ago
2005
Springer
Two of the attractions of search-based software engineering (SBSE) derive from the nature of the fitness functions used to guide the search. These have proved to be highly robust...
ISMIR
2005
Springer
15 years 3 months ago
2005
Springer
We introduce a new model for extracting classified structural segments, such as intro, verse, chorus, break and so forth, from recorded music. Our approach is to classify signal ...
100
click to vote
TBILLC
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Applying multi-agent systems in real world scenarios requires several essential research questions to be answered. Agents have to perceive their environment in order to t...
114
click to vote
VLSM
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Given an image, digital matting consists in extracting a foreground element from the background. Standard methods are initialized with a trimap, a partition of the image ...
PODC
2004
ACM
15 years 3 months ago
2004
ACM
We study a representative task allocation problem called shortest paths: Let G be a graph in which the edges are owned by self interested agents. The cost of each edge is privatel...