Sciweavers

1688 search results - page 209 / 338
» The Complexity of Rationalizing Matchings
Sort
View
DIALM
2000
ACM
107views Algorithms» more  DIALM 2000»
15 years 3 months ago
Efficient memoryless protocol for tag identification
This paper presents an efficient collision resolution protocol and its variations for the tag identification problem, where an electromagnetic reader attempts to obtain within its...
Ching Law, Kayi Lee, Kai-Yeung Siu
DLOG
2008
15 years 1 months ago
Realization Problem for Formal Concept Analysis
Formal Concept Analysis (FCA) is an approach to knowledge engineering, representation, and analysis. A `standard' FCA-workflow starts with some `experimental' data, class...
Nikolay Shilov
BIOCOMP
2008
15 years 25 days ago
Bioinformatics Tools: Searching for Markers in DNA/RNA Sequences
Research in bioinformatics and computational biology relies heavily on algorithms that facilitate the understanding of biological processes through the application of statistical ...
Kuha Mahalingam, Omar Bagasra
GCA
2008
15 years 24 days ago
Anomaly Detection and its Application in Grid
- Size and complexity of grid computing systems increase rapidly. Failures can have adverse effect on application executing on the system. Thus, failure information should be provi...
Thuy Nguyen, Thanh Do, Dung Nguyen, Hiep Nguyen, T...
IJCAI
2007
15 years 24 days ago
Direct Code Access in Self-Organizing Neural Networks for Reinforcement Learning
TD-FALCON is a self-organizing neural network that incorporates Temporal Difference (TD) methods for reinforcement learning. Despite the advantages of fast and stable learning, TD...
Ah-Hwee Tan