10608 search results - page 509 / 2122 » Complexity of O'Hara's Algorithm |
214
Voted
ERSHOV
2009
Springer
15 years 10 months ago
2009
Springer
A term t is called a template of terms t1 and t2 iff t1 = t1 and t2 = t2, for some substitutions 1 and 2. A template t of t1 and t2 is called the most specific iff for any template...
155
click to vote
IADIS
2008
15 years 7 months ago
2008
One approach to reduce the complexity of the task in the analysis of large scale genome-wide expression is to group the genes showing similar expression patterns into what are cal...
177
click to vote
SIMVIS
2003
15 years 7 months ago
2003
The paradigm of the proxel ("probability element") was recently introduced in order to provide a new algorithmic approach to analysing discrete-state stochastic models s...
155
Voted
AI
2008
Springer
15 years 6 months ago
2008
Springer
In the arena of automated negotiations we focus on the principal negotiation protocol in bilateral settings, i.e. the alternatingoffers protocol. In the scientific community it is...
159
click to vote
ADHOC
2006
15 years 6 months ago
2006
Self-organization of wireless sensor networks, which involves network decomposition into connected clusters, is a challenging task because of the limited bandwidth and energy reso...