Sciweavers

978 search results - page 144 / 196
» Knowledge, Probability, and Adversaries
Sort
View
IROS
2007
IEEE
110views Robotics» more  IROS 2007»
15 years 4 months ago
Multi-agent search with interim positive information
– A problem of searching with multiple searchers and scouts is presented. Unlike most search problems that terminate as soon as the target is found, successful detections by scou...
Haye Lau, Shoudong Huang, Gamini Dissanayake
LCN
2007
IEEE
15 years 4 months ago
Modeling and Performance Analysis of Telephony Gateway REgistration Protocol
Abstract—Telephony gateways are devices that interface between IP telephony networks and the PSTN. A telephony proxy or location server (LS) that attempts to connect a call for a...
Kushal Kumaran, Anirudha Sahoo
CLEF
2007
Springer
15 years 4 months ago
Unsupervised Acquiring of Morphological Paradigms from Tokenized Text
This paper describes a rather simplistic method of unsupervised morphological analysis of words in an unknown language. All what is needed is a raw text corpus in the given langua...
Daniel Zeman
COCO
2007
Springer
93views Algorithms» more  COCO 2007»
15 years 4 months ago
S-T Connectivity on Digraphs with a Known Stationary Distribution
We present a deterministic logspace algorithm for solving S-T Connectivity on directed graphs if (i) we are given a stationary distribution of the random walk on the graph in whic...
Kai-Min Chung, Omer Reingold, Salil P. Vadhan
CP
2007
Springer
15 years 4 months ago
Hierarchical Hardness Models for SAT
Abstract. Empirical hardness models are a recent approach for studying NP-hard problems. They predict the runtime of an instance using efficiently computable features. Previous res...
Lin Xu, Holger H. Hoos, Kevin Leyton-Brown