Sciweavers

3055 search results - page 491 / 611
» Randomized Search Trees
Sort
View
ICGI
2010
Springer
15 years 2 months ago
Exact DFA Identification Using SAT Solvers
Abstract. We present an exact algorithm for identification of deterministic finite automata (DFA) which is based on satisfiability (SAT) solvers. Despite the size of the low level ...
Marijn J. H. Heule, Sicco Verwer
CORR
2011
Springer
200views Education» more  CORR 2011»
14 years 11 months ago
An Analysis of Optimal Link Bombs
We analyze the recent phenomenon termed a Link Bomb, and investigate the optimal attack pattern for a group of web pages attempting to link bomb a specific web page. The typical ...
Sibel Adali, Tina Liu, Malik Magdon-Ismail
OL
2011
332views Neural Networks» more  OL 2011»
14 years 11 months ago
A robust implementation of a sequential quadratic programming algorithm with successive error restoration
We consider sequential quadratic programming (SQP) methods for solving constrained nonlinear programming problems. It is generally believed that SQP methods are sensitive to the a...
Klaus Schittkowski
WWW
2008
ACM
16 years 4 months ago
Learning transportation mode from raw gps data for geographic applications on the web
Geographic information has spawned many novel Web applications where global positioning system (GPS) plays important roles in bridging the applications and end users. Learning kno...
Yu Zheng, Like Liu, Longhao Wang, Xing Xie
STOC
2005
ACM
135views Algorithms» more  STOC 2005»
16 years 4 months ago
On the bias of traceroute sampling: or, power-law degree distributions in regular graphs
Understanding the graph structure of the Internet is a crucial step for building accurate network models and designing efficient algorithms for Internet applications. Yet, obtaini...
Dimitris Achlioptas, Aaron Clauset, David Kempe, C...