Sciweavers

1940 search results - page 247 / 388
» Search with Synonyms: Problems and Solutions
Sort
View
JCM
2007
131views more  JCM 2007»
15 years 6 months ago
Routing in Optical and Non-Optical Networks using Boolean Satisfiability
—Today, most routing problems are solved using Dijkstra’s shortest path algorithm. Many efficient implementations of Dijkstra’s algorithm exist and can handle large networks ...
Fadi A. Aloul, Bashar Al Rawi, Mokhtar Aboelaze
ICDM
2009
IEEE
152views Data Mining» more  ICDM 2009»
16 years 1 months ago
SLIDER: Mining Correlated Motifs in Protein-Protein Interaction Networks
Correlated motif mining (CMM) is the problem to find overrepresented pairs of patterns, called motif pairs, in interacting protein sequences. Algorithmic solutions for CMM thereb...
Peter Boyen, Frank Neven, Dries Van Dyck, Aalt-Jan...
SASO
2007
IEEE
16 years 25 days ago
Improving ICE Service Selection in a P2P System using the Gradient Topology
Internet Connectivity Establishment (ICE) is becoming increasingly important for P2P systems on the open Internet, as it enables NAT-bound peers to provide accessible services. A ...
Jim Dowling, Jan Sacha, Seif Haridi
GECCO
2005
Springer
155views Optimization» more  GECCO 2005»
16 years 2 days ago
An artificial immune network for multimodal function optimization on dynamic environments
Multimodal optimization algorithms inspired by the immune system are generally characterized by a dynamic control of the population size and by diversity maintenance along the sea...
Fabrício Olivetti de França, Fernand...
CISSE
2008
Springer
15 years 8 months ago
From Constraints to Resolution Rules Part I : conceptual framework
: Many real world problems appear naturally as constraints satisfaction problems (CSP), for which very efficient algorithms are known. Most of these involve the combination of two ...
Denis Berthier