8413 search results - page 1104 / 1683 » Ordering Problem Subgoals |
310
click to vote
ICDE
2006
IEEE
16 years 8 months ago
2006
IEEE
Scheduling/prioritization of DBMS transactions is important for many applications that rely on database backends. A convenient way to achieve scheduling is to limit the number of ...
350
click to vote
ICDE
1995
IEEE
16 years 8 months ago
1995
IEEE
Abstract. The problem of mining sequential patterns was recently introduced in 3 . We are given a database of sequences, where each sequence is a list of transactions ordered by tr...
202
click to vote
DAC
2001
ACM
16 years 8 months ago
2001
ACM
Boolean Satisfiability is probably the most studied of combinatorial optimization/search problems. Significant effort has been devoted to trying to provide practical solutions to ...
157
click to vote
DAC
2003
ACM
16 years 8 months ago
2003
ACM
Delay budget is an excess delay each component of a design can tolerate under a given timing constraint. Delay budgeting has been widely exploited to improve the design quality. W...
239
click to vote
IPMI
2003
Springer
16 years 8 months ago
2003
Springer
Abstract. For medical image analysis issues where the domain mappings between images involve large geometrical shape changes, such as the cases of nonrigid motion recovery and inte...