5180 search results - page 253 / 1036 » Concurrency, Time, and Constraints |
169
click to vote
ASPDAC
2007
ACM
15 years 10 months ago
2007
ACM
Parallel prefix adder is the most flexible and widely-used binary adder for ASIC designs. Many high-level synthesis techniques have been developed to find optimal prefix structures...
187
click to vote
QSHINE
2005
IEEE
16 years 8 days ago
2005
IEEE
An extended depth-first-search (EDFS) algorithm is proposed to solve the multi-constrained path (MCP) problem in quality-of-service (QoS) routing, which is NP-Complete when the n...
148
click to vote
CAISE
2004
Springer
16 years 2 days ago
2004
Springer
In UML2.0, significant efforts have been devoted towards a better definition of OCL. Still, the adoption of the language by the software engineers remains a significant challenge....
181
click to vote
ECCV
2010
Springer
16 years 21 hour ago
2010
Springer
Abstract. Many computer vision problems such as object segmentation or reconstruction can be formulated in terms of labeling a set of pixels or voxels. In certain scenarios, we may...
206
click to vote
CP
2003
Springer
15 years 12 months ago
2003
Springer
Abstract. Many real world problems, e.g. personnel scheduling and transportation planning, can be modeled naturally as Constrained Shortest Path Problems (CSPPs), i.e., as Shortest...