Sciweavers

4114 search results - page 96 / 823
» Efficient Algorithms for the 2-Center Problems
Sort
View
ASPDAC
2007
ACM
112views Hardware» more  ASPDAC 2007»
15 years 10 months ago
Efficient Second-Order Iterative Methods for IR Drop Analysis in Power Grid
Due to the extremely large sizes of power grids, IR drop analysis has become a computationally challenging problem both in terms of runtime and memory usage. It has been shown in [...
Yu Zhong, Martin D. F. Wong
COLT
2010
Springer
15 years 4 months ago
Active Learning on Trees and Graphs
We investigate the problem of active learning on a given tree whose nodes are assigned binary labels in an adversarial way. Inspired by recent results by Guillory and Bilmes, we c...
Nicolò Cesa-Bianchi, Claudio Gentile, Fabio...
GECCO
2009
Springer
132views Optimization» more  GECCO 2009»
15 years 4 months ago
Cooperative micro-particle swarm optimization
Cooperative approaches have proved to be very useful in evolutionary computation due to their ability to solve efficiently high-dimensional complex problems through the cooperatio...
Konstantinos E. Parsopoulos
ATAL
2005
Springer
16 years 8 days ago
Efficient information retrieval using mobile agents
We are concerned with the use of Mobile Agents for information retrieval. A multi-agent system is considered; a number of agents are involved in a collective effort to retrieve di...
Irene Sygkouna, Miltiades E. Anagnostou
WALCOM
2008
IEEE
82views Algorithms» more  WALCOM 2008»
15 years 8 months ago
Exact Algorithms for Maximum Acyclic Subgraph on a Superclass of Cubic Graphs
Abstract. Finding a maximum acyclic subgraph is on the list of problems that seem to be hard to tackle from a parameterized perspective. We develop two quite efficient algorithms (...
Henning Fernau, Daniel Raible