189 search results - page 28 / 38 » A generalization of the integer linear infeasibility problem |
ICCAD
2009
IEEE
13 years 5 months ago
2009
IEEE
Wire bonding is the most popular method to connect signals between dies in System-in-Package (SiP) design nowadays. Pad assignment, which assigns inter-die signals to die pads so ...
ATAL
2007
Springer
14 years 1 months ago
2007
Springer
Decentralized MDPs provide powerful models of interactions in multi-agent environments, but are often very difficult or even computationally infeasible to solve optimally. Here we...
SIGMOD
2010
ACM
14 years 13 days ago
2010
ACM
Maximal clique enumeration (MCE) is a fundamental problem in graph theory and has important applications in many areas such as social network analysis and bioinformatics. The prob...
ATAL
2008
Springer
13 years 9 months ago
2008
Springer
In a class of games known as Stackelberg games, one agent (the leader) must commit to a strategy that can be observed by the other agent (the follower or adversary) before the adv...
DAC
2008
ACM
14 years 8 months ago
2008
ACM
Embedded systems with heterogeneous processors extend the energy/timing trade-off flexibility and provide the opportunity to fine tune resource utilization for particular applicat...