9842 search results - page 1662 / 1969 » The Complexity of the Matching-Cut Problem |
133
click to vote
CSE
2009
IEEE
15 years 11 months ago
2009
IEEE
—Multi-agent systems are difficult to develop. One reason for this is that agents are embedded in a society where all agents must agree to obey certain social norms in order for...
153
click to vote
SISAP
2009
IEEE
15 years 11 months ago
2009
IEEE
—In the demonstration we will show a system for searching by similarity and automatically classifying images in a very large dataset. The demonstrated techniques are based on the...
176
click to vote
WCRE
2009
IEEE
15 years 11 months ago
2009
IEEE
—Code smells are poor implementation choices, thought to make object-oriented systems hard to maintain. In this study, we investigate if classes with code smells are more change-...
149
click to vote
ATAL
2009
Springer
15 years 11 months ago
2009
Springer
Multiagent systems are often characterized by complex, and sometimes unpredictable interactions amongst their autonomous components. While these systems can provide robust and sca...
136
click to vote
COCO
2009
Springer
15 years 11 months ago
2009
Springer
Graph Isomorphism is the prime example of a computational problem with a wide difference between the best known lower and upper bounds on its complexity. There is a significant ...