Sciweavers

1644 search results - page 312 / 329
» Finding Dominators in Practice
Sort
View
AAAI
1996
13 years 8 months ago
Improved Limited Discrepancy Search
We present an improvement to Harvey and Ginsberg's limited discrepancy search algorithm, which eliminates much of the redundancy in the original, by generating each path from...
Richard E. Korf
COMAD
2009
13 years 8 months ago
Large Maximal Cliques Enumeration in Large Sparse Graphs
Identifying communities in social networks is a problem of great interest. One popular type of community is where every member of the community knows all others, which can be view...
Natwar Modani, Kuntal Dey
ESA
2010
Springer
246views Algorithms» more  ESA 2010»
13 years 8 months ago
Estimating the Average of a Lipschitz-Continuous Function from One Sample
We study the problem of estimating the average of a Lipschitz continuous function f defined over a metric space, by querying f at only a single point. More specifically, we explore...
Abhimanyu Das, David Kempe
HPDC
2010
IEEE
13 years 8 months ago
BTWorld: towards observing the global BitTorrent file-sharing network
Today, the BitTorrent Peer-to-Peer file-sharing network is one of the largest Internet applications--it generates massive traffic volumes, it is deployed in thousands of independe...
Maciej Wojciechowski, Mihai Capotâ, Johan A....
GECCO
2008
Springer
135views Optimization» more  GECCO 2008»
13 years 8 months ago
Agent-based support for interactive search in conceptual software engineering design
While recent attempts to search a conceptual software engineering design search space with multi-objective evolutionary algorithms have yielded promising results, the practical ap...
Christopher L. Simons, Ian C. Parmee