2917 search results - page 246 / 584 » Satisfying Interaction Constraints |
170
click to vote
IJCAI
2001
15 years 8 months ago
2001
Boolean linear programs (BLPs) are ubiquitous in AI. Satisfiability testing, planning with resource constraints, and winner determination in combinatorial auctions are all example...
182
click to vote
ISLPED
2010
ACM
15 years 7 months ago
2010
ACM
The ongoing scaling of semiconductor technology is causing severe increase of on-chip power density and temperature in microprocessors. This has raised urgent requirement for both...
185
click to vote
CAD
2007
Springer
15 years 6 months ago
2007
Springer
In this paper, we present a BPM (Bézier Patch Mapping) algorithm which generates a strictly non-self-overlapping structured quadrilateral grid in a given four-sided planar region...
172
click to vote
JNW
2006
15 years 6 months ago
2006
Recently, the use of wireless sensor networks has spread to applications areas that are not viable or costefficient to be run on other types of networks. Due to some critical tasks...
135
click to vote
TROB
2002
15 years 6 months ago
2002
Given an arbitrary Petri net (PN) structure, which may have uncontrollable and unobservable transitions, the deadlock prevention procedure presented here determines a set of linear...