536 search results - page 51 / 108 » AI techniques in modelling, assignment, problem solving and ... |
137
click to vote
CONSTRAINTS
1998
14 years 11 months ago
1998
Many temporal applications like planning and scheduling can be viewed as special cases of the numeric and symbolic temporal constraint satisfaction problem. Thus we have developed ...
115
click to vote
ISSS
1996
IEEE
15 years 4 months ago
1996
IEEE
Code generation for embedded processors creates opportunities for several performance optimizations not applicable for traditional compilers. We present techniques for improving d...
114
click to vote
ISSS
2000
IEEE
15 years 4 months ago
2000
IEEE
This paper addresses the problem of estimating lower bounds on the power consumption in scheduled data flow graphs with a fixed number of allocated resources prior to binding. T...
DAM
1998
14 years 11 months ago
1998
Motivated by wavelength division multiplexing in all-optical networks, we consider the problem of finding a set of paths from a fixed source to a multiset of destinations, which c...
129
click to vote
ICCAD
2002
IEEE
15 years 8 months ago
2002
IEEE
Optimized solvers for the Boolean Satisfiability (SAT) problem have many applications in areas such as hardware and software verification, FPGA routing, planning, etc. Further use...