Sciweavers

917 search results - page 46 / 184
» The Generalized Trace-Norm and its Application to Structure-...
Sort
View
ALGORITHMICA
2011
15 years 1 months ago
An Approximation Algorithm for Binary Searching in Trees
We consider the problem of computing efficient strategies for searching in trees. As a generalization of the classical binary search for ordered lists, suppose one wishes to find...
Eduardo Sany Laber, Marco Molinaro
CORR
2010
Springer
178views Education» more  CORR 2010»
15 years 3 months ago
Adaptive Algorithms for Coverage Control and Space Partitioning in Mobile Robotic Networks
We consider deployment problems where a mobile robotic network must optimize its configuration in a distributed way in order to minimize a steady-state cost function that depends ...
Jerome Le Ny, George J. Pappas
AI
1998
Springer
15 years 10 months ago
A Heuristic Incremental Modeling Approach to Course Timetabling
Abstract. The general timetabling problem is an assignment of activities to xed time intervals, adhering to a prede ned set of resource availabilities. Timetabling problems are di ...
Don Banks, Peter van Beek, Amnon Meisels
WWW
2004
ACM
16 years 6 months ago
Securing web application code by static analysis and runtime protection
Security remains a major roadblock to universal acceptance of the Web for many kinds of transactions, especially since the recent sharp increase in remotely exploitable vulnerabil...
Yao-Wen Huang, Fang Yu, Christian Hang, Chung-Hung...
HOTNETS
2010
15 years 1 months ago
Diagnosing mobile applications in the wild
There are a lot of applications that run on modern mobile operating systems. Inevitably, some of these applications fail in the hands of users. Diagnosing a failure to identify the...
Sharad Agarwal, Ratul Mahajan, Alice Zheng, Victor...