Sciweavers

1064 search results - page 186 / 213
» Exact Algorithms for the Quadratic Linear Ordering Problem
Sort
View
IOR
2007
106views more  IOR 2007»
15 years 3 months ago
Planning and Scheduling by Logic-Based Benders Decomposition
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve an important class of planning and scheduling problems. Tasks are allocated to faciliti...
John N. Hooker
CADE
2009
Springer
15 years 10 months ago
Interpolant Generation for UTVPI
Abstract. The problem of computing Craig interpolants in SMT has recently received a lot of interest, mainly for its applications in formal verification. Efficient algorithms for ...
Alessandro Cimatti, Alberto Griggio, Roberto Sebas...
135
Voted
MDM
2010
Springer
152views Communications» more  MDM 2010»
15 years 8 months ago
Finding One-Of Probably Nearest Neighbors with Minimum Location Updates
—Location information is necessarily uncertain when objects are constantly moving. The cost can be high to maintain precise locations at the application server for all the object...
Mitzi McCarthy, Xiaoyang Sean Wang, Zhen He
ICDE
2004
IEEE
100views Database» more  ICDE 2004»
16 years 5 months ago
Scalable Multimedia Disk Scheduling
A new multimedia disk scheduling algorithm, termed Cascaded-SFC, is presented. The Cascaded-SFC multimedia disk scheduler is applicable in environments where multimedia data reque...
Mohamed F. Mokbel, Walid G. Aref, Khaled M. Elbass...
MIS
2004
Springer
162views Multimedia» more  MIS 2004»
15 years 9 months ago
Integrating the Results of Multimedia Sub-Queries Using Qualitative Preferences
When similarity queries over multimedia databases are processed by splitting the overall query condition into a set of sub-queries, the problem of how to efficiently and effectiv...
Ilaria Bartolini, Paolo Ciaccia, Vincent Oria, M. ...