Sciweavers

2100 search results - page 75 / 420
» Fundamentals of the problem
Sort
View
INFOCOM
2007
IEEE
14 years 4 months ago
Finding Minimum-Cost Paths with Minimum Sharability
Abstract— In communication networks, multiple communication paths sharing minimum number of links or/and nodes may be desirable for improved performance, resource utilization and...
Si-Qing Zheng, Bing Yang, Mei Yang, Jianping Wang
GECCO
2005
Springer
136views Optimization» more  GECCO 2005»
14 years 3 months ago
Preventing overfitting in GP with canary functions
Overfitting is a fundamental problem of most machine learning techniques, including genetic programming (GP). Canary functions have been introduced in the literature as a concept ...
Nate Foreman, Matthew P. Evett
MLCW
2005
Springer
14 years 3 months ago
Learning Textual Entailment on a Distance Feature Space
Textual Entailment recognition is a very difficult task as it is one of the fundamental problems in any semantic theory of natural language. As in many other NLP tasks, Machine Lea...
Maria Teresa Pazienza, Marco Pennacchiotti, Fabio ...
ISMB
2000
13 years 11 months ago
Combinatorial Approaches to Finding Subtle Signals in DNA Sequences
Signal nding pattern discovery in unaligned DNA sequences is a fundamental problem in both computer science and molecular biology with important applications in locating regulator...
Pavel A. Pevzner, Sing-Hoi Sze
ICECCS
2010
IEEE
161views Hardware» more  ICECCS 2010»
13 years 10 months ago
Model Checking Round-Based Distributed Algorithms
—In the field of distributed computing, there are many round-based algorithms to solve fundamental problems, such as leader election and distributed consensus. Due to the nature...
Xin An, Jun Pang