Sciweavers

4679 search results - page 80 / 936
» Modeling When Connections Are the Problem
Sort
View
DAM
2008
114views more  DAM 2008»
15 years 1 months ago
Efficient solutions to the braid isotopy problem
We describe the most efficient solutions to the word problem of Artin's braid group known so far, i.e., in other words, the most efficient solutions to the braid isotopy probl...
Patrick Dehornoy
ICDE
2008
IEEE
178views Database» more  ICDE 2008»
16 years 2 months ago
On the Optimal Selection of k in the k-Anonymity Problem
When disseminating data involving human subjects, researchers have to weigh in the requirements of privacy of the individuals involved in the data. A model widely used for enhancin...
Rinku Dewri, Indrajit Ray, Indrakshi Ray, Darrell ...
SIES
2008
IEEE
15 years 8 months ago
An investigation of the clique problem in FlexRay
—Distributed, time-triggered communication based on FlexRay is likely to become an enabler for future safety related applications in the automotive domain. Prior to series deploy...
Paul Milbredt, Martin Horauer, Andreas Steininger
AAAI
1992
15 years 2 months ago
The Expected Value of Hierarchical Problem-Solving
est case using an abstraction hierarchy in problem-solving can yield an exponential speed-up in search e ciency. Such a speed-up is predicted by various analytical models develope...
Fahiem Bacchus, Qiang Yang
118
Voted
LATIN
2000
Springer
15 years 5 months ago
Approximation Algorithms for Flexible Job Shop Problems
The Flexible Job Shop problem is a generalization of the classical job shop scheduling problem in which for every operation there is a group of machines that can process it. The p...
Klaus Jansen, Monaldo Mastrolilli, Roberto Solis-O...