1984 search results - page 154 / 397 » The colourful feasibility problem |
189
click to vote
ECRTS
2010
IEEE
15 years 7 months ago
2010
IEEE
It is challenging to support the timeliness of realtime data service requests in data-intensive real-time applications such as online auction or stock trading, while maintaining t...
138
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
Determining if a group of proteins are functionally associated among themselves is an open problem in molecular biology. Within our long term goal of applying Genetic Programming ...
136
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Consider a routing problem instance consisting of a demand graph H = (V, E(H)) and a supply graph G = (V, E(G)). If the pair obeys the cut condition, then the flow-cut gap for thi...
168
click to vote
AUTOMATICA
2004
15 years 6 months ago
2004
Ellipsoidal outer-bounding of the set of all feasible state vectors under model uncertainty is a natural extension of state estimation for deterministic models with unknown-but-bo...
200
click to vote
ICST
2010
IEEE
15 years 5 months ago
2010
IEEE
—Recent advances in automated functional testing of Graphical User Interfaces (GUIs) rely on deriving graph models that approximate all possible sequences of events that may be e...