Sciweavers

4604 search results - page 600 / 921
» Analysis of Negotiation Dynamics
Sort
View
208
Voted
CORR
2010
Springer
99views Education» more  CORR 2010»
15 years 6 months ago
Locating phase transitions in computationally hard problems
We discuss how phase-transitions may be detected in computationally hard problems in the context of anytime algorithms. Treating the computational time, value and utility functions...
B. Ashok, T. K. Patra
CORR
2008
Springer
103views Education» more  CORR 2008»
15 years 6 months ago
Core Persistence in Peer-to-Peer Systems: Relating Size to Lifetime
Distributed systems are now both very large and highly dynamic. Peer to peer overlay networks have been proved efficient to cope with this new deal that traditional approaches can ...
Vincent Gramoli, Anne-Marie Kermarrec, Achour Most...
BMCBI
2006
129views more  BMCBI 2006»
15 years 6 months ago
Fast index based algorithms and software for matching position specific scoring matrices
Background: In biological sequence analysis, position specific scoring matrices (PSSMs) are widely used to represent sequence motifs in nucleotide as well as amino acid sequences....
Michael Beckstette, Robert Homann, Robert Giegeric...
IJCV
2008
188views more  IJCV 2008»
15 years 6 months ago
Partial Linear Gaussian Models for Tracking in Image Sequences Using Sequential Monte Carlo Methods
The recent development of Sequential Monte Carlo methods (also called particle filters) has enabled the definition of efficient algorithms for tracking applications in image sequen...
Elise Arnaud, Étienne Mémin
IJIPT
2008
191views more  IJIPT 2008»
15 years 6 months ago
ARPM: Agent-based Routing Protocol for MANET
Mobile ad-hoc networks (MANETs) are infrastructure-less networks where no central network management exists, composed of mobile nodes over wireless links. Network topology in MANE...
Helen Bakhsh, Manal Abdullah