1381 search results - page 144 / 277 » Computational Complexity of Constraint Satisfaction |
130
click to vote
GECCO
2009
Springer
15 years 10 months ago
2009
Springer
Software agents help automate a variety of tasks including those involved in buying and selling products over the internet. The need for handling complex highly configurable produ...
123
click to vote
ICSE
2009
IEEE-ACM
15 years 11 months ago
2009
IEEE-ACM
Minimizing the computing infrastructure (such as processors) in a distributed real-time embedded (DRE) system deployment helps reduce system size, weight, power consumption, and c...
128
click to vote
DSD
2007
IEEE
15 years 10 months ago
2007
IEEE
Synchronous Data Flow Graphs (SDFGs) are a very useful means for modeling and analyzing streaming applications. Some performance indicators, such as throughput, have been studied b...
126
click to vote
GD
2005
Springer
15 years 9 months ago
2005
Springer
Most graph layout algorithms treat nodes as points. The problem of node overlap removal is to adjust the layout generated by such methods so that nodes of non-zero width and height...
144
click to vote
CHARME
2003
Springer
15 years 9 months ago
2003
Springer
We present a non-operational approach to specifying and analyzing shared memory consistency models. The method uses higher order logic to capture a complete set of ordering constra...