Sciweavers

2354 search results - page 311 / 471
» Assignment Problems
Sort
View
JCM
2007
131views more  JCM 2007»
15 years 6 months ago
Routing in Optical and Non-Optical Networks using Boolean Satisfiability
—Today, most routing problems are solved using Dijkstra’s shortest path algorithm. Many efficient implementations of Dijkstra’s algorithm exist and can handle large networks ...
Fadi A. Aloul, Bashar Al Rawi, Mokhtar Aboelaze
IUI
2006
ACM
16 years 6 days ago
SWISH: semantic analysis of window titles and switching history
Information workers are often involved in multiple tasks and activities that they must perform in parallel or in rapid succession. In consequence, task management itself becomes y...
Nuria Oliver, Greg Smith, Chintan Thakkar, Arun C....
ICCAD
2002
IEEE
227views Hardware» more  ICCAD 2002»
16 years 3 months ago
Generic ILP versus specialized 0-1 ILP: an update
Optimized solvers for the Boolean Satisfiability (SAT) problem have many applications in areas such as hardware and software verification, FPGA routing, planning, etc. Further use...
Fadi A. Aloul, Arathi Ramani, Igor L. Markov, Kare...
MEDINFO
2007
15 years 7 months ago
Using Discourse Analysis to Improve Text Categorization in MEDLINE
PROBLEM: Automatic keyword assignment has been largely studied in medical informatics in the context of the MEDLINE database, both for helping search in MEDLINE and in order to pr...
Patrick Ruch, Antoine Geissbühler, Julien Gob...
CVPR
2007
IEEE
16 years 8 months ago
On-the-fly Object Modeling while Tracking
To implement a persistent tracker, we build a set of viewdependent object appearance models adaptively and automatically while tracking an object under different viewing angles. T...
Zhaozheng Yin, Robert T. Collins