Sciweavers

1977 search results - page 246 / 396
» The satisfactory partition problem
Sort
View
SSD
2001
Springer
122views Database» more  SSD 2001»
15 years 8 months ago
Calendars, Time Granularities, and Automata
The notion of time granularity comes into play in a variety of problems involving time representation and management in database applications, including temporal database design, t...
Ugo Dal Lago, Angelo Montanari
ICCAD
2000
IEEE
109views Hardware» more  ICCAD 2000»
15 years 8 months ago
General Models for Optimum Arbitrary-Dimension FPGA Switch Box Designs
–An FPGA switch box is said to be hyper-universal if it is routable for all possible surrounding multi-pin net topologies satisfying the routing resource constraints. It is desir...
Hongbing Fan, Jiping Liu, Yu-Liang Wu
CONCUR
1999
Springer
15 years 8 months ago
Robust Satisfaction
In order to check whether an open system satisfies a desired property, we need to check the behavior of the system with respect to an arbitrary environment. In the most general se...
Orna Kupferman, Moshe Y. Vardi
ERCIMDL
2000
Springer
147views Education» more  ERCIMDL 2000»
15 years 8 months ago
Map Segmentation by Colour Cube Genetic K-Mean Clustering
Segmentation of a colour image composed of different kinds of texture regions can be a hard problem, namely to compute for an exact texture fields and a decision of the optimum num...
Vitorino Ramos, Fernando Muge
ICWS
2010
IEEE
15 years 5 months ago
Highly Scalable Web Service Composition Using Binary Tree-Based Parallelization
Data intensive applications, e.g. in life sciences, pose new efficiency challenges to the service composition problem. Since today computing power is mainly increased by multiplica...
Patrick Hennig, Wolf-Tilo Balke