388 search results - page 64 / 78 » A Mixed Closure-CSP Method to Solve Scheduling Problems |
106
click to vote
ATAL
2009
Springer
15 years 6 months ago
2009
Springer
Commitment-modeled protocols enable flexible and robust interactions among agents. However, existing work has focused on features and capabilities of protocols without considerin...
106
click to vote
C3S2E
2010
ACM
15 years 25 days ago
2010
ACM
Propositional satisfiability solving, or SAT, is an important reasoning task arising in numerous applications, such as circuit design, formal verification, planning, scheduling or...
97
Voted
ICC
2007
IEEE
15 years 6 months ago
2007
IEEE
We consider a single-cell multiple-input multiple-output (MIMO) downlink channel where linear transmission and reception strategy is employed. The base station (BS) transmitter is...
ATAL
2009
Springer
15 years 6 months ago
2009
Springer
Stigmergy is usually associated with semantically simple problems such as routing. It can be applied to more complex problems by encoding them in the environment through which sti...
BMCBI
2008
14 years 12 months ago
2008
Background: Although fold change is a commonly used criterion in quantitative proteomics for differentiating regulated proteins, it does not provide an estimation of false positiv...