Sciweavers

340 search results - page 18 / 68
» Approximate equality is no fuzzy equality
Sort
View
ISAAC
2000
Springer
178views Algorithms» more  ISAAC 2000»
13 years 11 months ago
Simple Algorithms for a Weighted Interval Selection Problem
Given a set of jobs, each consisting of a number of weighted intervals on the real line, and a number m of machines, we study the problem of selecting a maximum weight subset of th...
Thomas Erlebach, Frits C. R. Spieksma
LICS
2003
IEEE
14 years 20 days ago
Revisiting Digitization, Robustness, and Decidability for Timed Automata
We consider several questions related to the use of digitization techniques for timed automata. These very successful techniques reduce dense-time language inclusion problems to d...
Joël Ouaknine, James Worrell
CONCUR
2012
Springer
11 years 9 months ago
Making Weighted Containment Feasible: A Heuristic Based on Simulation and Abstraction
Simulation and Abstraction Guy Avni and Orna Kupferman School of Computer Science and Engineering, Hebrew University, Israel Weighted automata map input words to real numbers and a...
Guy Avni, Orna Kupferman
ICDE
2008
IEEE
163views Database» more  ICDE 2008»
14 years 8 months ago
Approximate Joins for Data-Centric XML
In data integration applications, a join matches elements that are common to two data sources. Often, however, elements are represented slightly different in each source, so an app...
Nikolaus Augsten, Michael H. Böhlen, Curtis E...
AAIM
2007
Springer
188views Algorithms» more  AAIM 2007»
14 years 1 months ago
Approximation Algorithms for the Graph Orientation Minimizing the Maximum Weighted Outdegree
Given an undirected graph G = (V, E) and a weight function w : E → Z+ , we consider the problem of orienting all edges in E so that the maximum weighted outdegree among all verti...
Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirot...