Sciweavers

1264 search results - page 225 / 253
» The framework approach for constraint satisfaction
Sort
View
SIGMOD
2010
ACM
239views Database» more  SIGMOD 2010»
15 years 6 months ago
Computing label-constraint reachability in graph databases
Our world today is generating huge amounts of graph data such as social networks, biological networks, and the semantic web. Many of these real-world graphs are edge-labeled graph...
Ruoming Jin, Hui Hong, Haixun Wang, Ning Ruan, Yan...
AIME
2001
Springer
15 years 6 months ago
Dynamic Adaptation of Cooperative Agents for MRI Brain Scans Segmentation
To cope with the difficulty of MRI brain scans automatic segmentation, we need to constrain and control the selection and the adjustment of processing tools depending on the local ...
Nathalie Richard, Michel Dojat, Catherine Garbay
FCCM
1999
IEEE
111views VLSI» more  FCCM 1999»
15 years 6 months ago
Optimizing FPGA-Based Vector Product Designs
This paper presents a method, called multiple constant multiplier trees MCMTs, for producing optimized recon gurable hardware implementations of vector products. An algorithm for ...
Dan Benyamin, John D. Villasenor, Wayne Luk
ICRA
1998
IEEE
142views Robotics» more  ICRA 1998»
15 years 6 months ago
Lagrangian Relaxation Neural Networks for Job Shop Scheduling
Abstract--Manufacturing scheduling is an important but difficult task. In order to effectively solve such combinatorial optimization problems, this paper presents a novel Lagrangia...
Peter B. Luh, Xing Zhao, Yajun Wang
IDEAS
1998
IEEE
112views Database» more  IDEAS 1998»
15 years 6 months ago
Transitive Dependencies in Transaction Closures
Complex applications consist of a large set of transactions which are interrelated. There are different kinds of dependencies among transactions of a complex application, e.g. ter...
Kerstin Schwarz, Can Türker, Gunter Saake