Sciweavers

1816 search results - page 90 / 364
» A New Approach for Solving the Maximum Clique Problem
Sort
View
CCIA
2006
Springer
15 years 9 months ago
Learning from cooperation using justifications
In multi-agent systems, individual problem solving capabilities can be improved thanks to the interaction with other agents. In the classification problem solving task each agent i...
Eloi Puertas, Eva Armengol
FOCS
1997
IEEE
15 years 10 months ago
Beyond the Flow Decomposition Barrier
We introduce a new approach to the maximum flow problem. This approach is based on assigning arc lengths based on the residual flow value and the residual arc capacities. Our appro...
Andrew V. Goldberg, Satish Rao
ISAAC
2009
Springer
121views Algorithms» more  ISAAC 2009»
16 years 17 days ago
Generalized Reduction to Compute Toric Ideals
Toric ideals have many applications including solving integer programs. Several algorithms for computing the toric ideal of an integer matrix are available in the literature. Since...
Deepanjan Kesh, Shashank K. Mehta
FLAIRS
2004
15 years 7 months ago
Dynamic Agent-Ordering and Nogood-Repairing in Distributed Constraint Satisfaction Problems
The distributed constraint satisfaction problem (CSP) is a general formalization used to represent problems in distributed multi-agent systems. To deal with realistic problems, mu...
Lingzhong Zhou, John Thornton, Abdul Sattar
CVPR
2011
IEEE
15 years 2 months ago
Adapting an Object Detector by Considering the Worst Case: a Conservative Approach
The performance of an offline-trained classifier can be improved on-site by adapting the classifier towards newly acquired data. However, the adaptation rate is a tuning parame...
Guang Chen, TonyX. Han