3946 search results - page 346 / 790 » The computational complexity of choice sets |
139
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
Integer octagonal constraints (a.k.a. Unit Two Variables Per Inequality or UTVPI integer constraints) constitute an interesting class of constraints for the representation and solu...
170
click to vote
PERVASIVE
2008
Springer
15 years 6 months ago
2008
Springer
This work reports on the findings of a field study examining the current use practices of large ambient information displays in public settings. Such displays are often assumed to ...
136
click to vote
JC
2002
15 years 6 months ago
2002
It has been known how to use computational fixed point theorems to verify existence and uniqueness of a true solution to a nonlinear system of equations within a small region abou...
196
click to vote
SIGMETRICS
2002
ACM
15 years 6 months ago
2002
ACM
We introduce a new methodology for the exact analysis of M/G/1-type Markov processes. The methodology uses basic, well-known results for Markov chains by exploiting the structure ...
226
click to vote
RECOMB
2010
Springer
15 years 5 months ago
2010
Springer
In comparative genomics, various combinatorial models can be used to specify gene clusters — groups of genes that are co-located in a set of genomes. Several approaches have been...