Sciweavers

102291 search results - page 20121 / 20459
» Computability in Computational Geometry
Sort
View
CONSTRAINTS
2008
117views more  CONSTRAINTS 2008»
15 years 6 months ago
Domain Specific High-Level Constraints for User Interface Layout
We present the Auckland Layout Model (ALM), a constraint-based technique for specifying 2D layout as it is used for arranging the controls in a GUI. Most GUI frameworks offer layo...
Christof Lutteroth, Robert Strandh, Gerald Weber
COR
2008
99views more  COR 2008»
15 years 6 months ago
Genetic local search for multicast routing with pre-processing by logarithmic simulated annealing
Over the past few years, several local search algorithms have been proposed for various problems related to multicast routing in the off-line mode. We describe a population-based ...
Mohammed S. Zahrani, Martin J. Loomes, James A. Ma...
CORR
2010
Springer
115views Education» more  CORR 2010»
15 years 6 months ago
The complexity of solving reachability games using value and strategy iteration
Concurrent reachability games is a class of games heavily studied by the computer science community, in particular by the formal methods community. Two standard algorithms for app...
Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, P...
CORR
2008
Springer
118views Education» more  CORR 2008»
15 years 6 months ago
The price of certainty: "waterslide curves" and the gap to capacity
The classical problem of reliable point-to-point digital communication is to achieve a low probability of error while keeping the rate high and the total power consumption small. ...
Anant Sahai, Pulkit Grover
CORR
2008
Springer
170views Education» more  CORR 2008»
15 years 6 months ago
To Broad-Match or Not to Broad-Match : An Auctioneer's Dilemma ?
We initiate the study of an interesting aspect of sponsored search advertising, namely the consequences of broad match- a feature where an ad of an advertiser can be mapped to a b...
Sudhir Kumar Singh, Vwani P. Roychowdhury
« Prev « First page 20121 / 20459 Last » Next »