Sciweavers

866 search results - page 142 / 174
» On Dynamic Shortest Paths Problems
Sort
View
CPAIOR
2010
Springer
14 years 2 months ago
Upper Bounds on the Number of Solutions of Binary Integer Programs
We present a new method to compute upper bounds of the number of solutions of binary integer programming (BIP) problems. Given a BIP, we create a dynamic programming (DP) table for...
Siddhartha Jain, Serdar Kadioglu, Meinolf Sellmann
ISER
2000
Springer
107views Robotics» more  ISER 2000»
14 years 1 months ago
Singularity Handling on Puma in Operational Space Formulation
: A solution to the singularity problem is presented from the approach of the operational space formulation which involves both motion and force control. A brief summary of the Ope...
Denny Oetomo, Marcelo H. Ang, Ser Yong Lim
CDC
2010
IEEE
160views Control Systems» more  CDC 2010»
13 years 4 months ago
Aggregation-based model reduction of a Hidden Markov Model
This paper is concerned with developing an information-theoretic framework to aggregate the state space of a Hidden Markov Model (HMM) on discrete state and observation spaces. The...
Kun Deng, Prashant G. Mehta, Sean P. Meyn
VLDB
2000
ACM
125views Database» more  VLDB 2000»
14 years 1 months ago
Focused Crawling Using Context Graphs
Maintaining currency of search engine indices by exhaustive crawling is rapidly becoming impossible due to the increasing size and dynamic content of the web. Focused crawlers aim...
Michelangelo Diligenti, Frans Coetzee, Steve Lawre...
RTSS
2005
IEEE
14 years 3 months ago
Enhanced EDF Scheduling Algorithms for Orchestrating Network-Wide Active Measurements
Monitoring network status such as end-to-end delay, jitter, and available bandwidth is important to support QoS-sensitive applications and timely detection of network anomalies li...
Prasad Calyam, Chang-Gun Lee, Phani Kumar Arava, D...