4377 search results - page 111 / 876 » Mass problems and randomness |
157
click to vote
IDEAL
2010
Springer
15 years 4 months ago
2010
Springer
Intrusion detection in computer networks faces the problem of a large number of both false alarms and unrecognized attacks. To improve the precision of detection, various machine l...
172
click to vote
JCO
2010
15 years 4 months ago
2010
We study the extremal parameter N(n, m, H) which is the largest number of copies of a hypergraph H that can be formed of at most n vertices and m edges. Generalizing previous work...
159
click to vote
ACL
2010
15 years 3 months ago
2010
Finding allowable places in words to insert hyphens is an important practical problem. The algorithm that is used most often nowadays has remained essentially unchanged for 25 yea...
141
click to vote
CDC
2010
IEEE
15 years 17 days ago
2010
IEEE
We consider the problem of designing controllers for nonholonomic mobile robots converging to the source (minimum) of a field. In addition to the mobility constraints posed by the ...
192
click to vote
CORR
2011
Springer
15 years 17 days ago
2011
Springer
Dynamic graphs have emerged as an appropriate model to capture the changing nature of many modern networks, such as peer-to-peer overlays and mobile ad hoc networks. Most of the re...