Sciweavers

16404 search results - page 552 / 3281
» A set coverage problem
Sort
View
ECAI
2008
Springer
15 years 8 months ago
A BDD Approach to the Feature Subscription Problem
Modern feature-rich telecommunications services offer significant opportunities to human users. To make these services more usable, facilitating personalisation is very important s...
Tarik Hadzic, David Lesaint, Deepak Mehta, Barry O...
MEDINFO
2007
112views Healthcare» more  MEDINFO 2007»
15 years 8 months ago
SNOMED CT's Problem List: Ontologists' and Logicians' Therapy Suggestions
After a critical review of the present architecture of SNOMED CT, addressing both logical and ontological issues, we present a roadmap towards an overall improvement of this termi...
Stefan Schulz, Boontawee Suntisrivaraporn, Franz B...
AAAI
2006
15 years 8 months ago
Optimal Scheduling of Contract Algorithms for Anytime Problems
A contract algorithm is an algorithm which is given, as part of the input, a specified amount of allowable computation time. The algorithm must then compute a solution within the ...
Alejandro López-Ortiz, Spyros Angelopoulos,...
SIGMETRICS
2008
ACM
15 years 6 months ago
An SLA perspective on the router buffer sizing problem
In this paper, we discuss recent work on buffer sizing in the context of an ISP's need to offer and guarantee competitive Service Level Agreements (SLAs) to its customers. Si...
Joel Sommers, Paul Barford, Albert G. Greenberg, W...
JAIR
1998
92views more  JAIR 1998»
15 years 6 months ago
The Gn, m Phase Transition is Not Hard for the Hamiltonian Cycle Problem
Using an improved backtrack algorithm with sophisticated pruning techniques, we revise previous observations correlating a high frequency of hard to solve Hamiltonian cycle instan...
Basil Vandegriend, Joseph C. Culberson